Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time

DOI10.1016/j.ejor.2007.08.019zbMath1149.90057OpenAlexW2013179296MaRDI QIDQ933504

B. E. Eshmatov

Publication date: 21 July 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/1262

zbMATH Keywords

schedulingsingle machinemulti-operation jobsjob-batch restrictionSPT-agreeability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Optimal single machine scheduling of products with components and changeover cost

Cites Work

• Unnamed Item
• Some simplified NP-complete graph problems
• Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
• Scheduling multi-operation jobs on a single machine
• A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs
• Complexity of Scheduling under Precedence Constraints

This page was built for publication: Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time