Work

Strong NP-hardness of two-machine flow-shop scheduling with periodic due dates(具有等间隔工期的2台机器流水作业调度问题的强NP难性)

Year: 2024

Type: article

Source: DOAJ (DOAJ: Directory of Open Access Journals)

DOI: 10.3785/j.issn.1008-9497.2024.05.010

Authors: 崔晓龙(CUI Xiaolong), 何周力(HE Zhouli), 梅嘉杰(MEI Jiajie), 万龙(WAN Long)

Language: English

Topic: Scheduling and Optimization Algorithms

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W6929049372

FWCI:

Cites:

Cited by:

Related to: