Two-machine interval shop scheduling with time lags

DOI10.1007/S10951-013-0336-YzbMath1328.90063OpenAlexW1979469095MaRDI QIDQ892834

Xiandong Zhang, Steef L. van de Velde

Publication date: 12 November 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-013-0336-y

zbMATH Keywords

dynamic programmingNP-hardnessinterval schedulingfixed start and end timestwo-machine shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial-time approximation schemes for scheduling problems with time lags
• Scheduling jobs with fixed start and end times
• A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• Minimizing the weighted number of tardy jobs on a two-machine flow shop.
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Sequencing n Jobs on Two Machines with Arbitrary Time Lags
• Two-machine open shop scheduling with special transportation times
• Heuristics for a coupled-operation scheduling problem
• Interval scheduling: A survey
• Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
• The complexity of satisfiability problems
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• The complexity of theorem-proving procedures
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Hard tiling problems with simple tiles

This page was built for publication: Two-machine interval shop scheduling with time lags