PARALLEL MACHINE SCHEDULING WITH A SIMULTANEITY CONSTRAINT AND UNIT-LENGTH JOBS TO MINIMIZE THE MAKESPAN

DOI10.1142/S0217595910002934zbMath1230.90094MaRDI QIDQ3074794

Xian-Wei Zhou, Yanpei Liu, Ruyan Fu, Lin Lin

Publication date: 10 February 2011

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmparallel machine schedulingsimultaneity constraint

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Dynamic scheduling on parallel machines
• Parallel machine scheduling of machine-dependent jobs with unit-length.
• Batch processing with interval graph compatibilities between tasks
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: PARALLEL MACHINE SCHEDULING WITH A SIMULTANEITY CONSTRAINT AND UNIT-LENGTH JOBS TO MINIMIZE THE MAKESPAN