Scheduling groups of unit length jobs on two identical parallel machines.

DOI10.1016/S0020-0190(99)00026-5MaRDI QIDQ1606911zbMATH OpenOpenAlexFDO

Authors Zhaohui Liu, Wen-Ci Yu, T. C. Edwin Cheng

Publication date 25 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(99)00026-5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• The complexity of two group scheduling problems
• Batch scheduling with deadlines on parallel machines: an NP-hard case
• Is a unit-job shop not easier than identical parallel machines?
• Parallel Machine Scheduling with Batch Setup Times
• A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs

Cites work

• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Parallel Machine Scheduling with Batch Setup Times

Cited in

(7)

• Is a unit-job shop not easier than identical parallel machines?
• Batch scheduling on uniform machines to minimize total flow-time
• The complexity of two group scheduling problems
• Scheduling jobs of equal length: Complexity, facets and computational results
• A survey of scheduling problems with setup times or costs
• A batch scheduling problem with two agents
• Scheduling jobs of equal length: complexity, facets and computational results

This page was built for publication: Scheduling groups of unit length jobs on two identical parallel machines.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606911)