Two-machine interval shop scheduling with time lags

DOI10.1007/S10951-013-0336-YMaRDI QIDQ892834zbMATH OpenOpenAlexFDO

Authors Xiandong Zhang, Steef 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)

Recommendations

• Schedule execution for two-machine flow-shop with interval processing times
• Algorithms and Computation
• On-line two-machine job shop scheduling with time lags
• Two-machine flow-shop minimum-length scheduling with interval processing times
• On-line two-machine open shop scheduling with time lags
• SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
• Two-machine shop scheduling with zero and unit processing times
• Two-machine flow shop scheduling problems with minimal and maximal delays
• The two-machine flowshop scheduling problem with total tardiness
• Two-machine flowshop scheduling to minimize total tardiness

Cites work

• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2119734 (Why is no real title available?)
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
• Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• Hard tiling problems with simple tiles
• Heuristics for a coupled-operation scheduling problem
• Interval scheduling: A survey
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Minimizing the weighted number of tardy jobs on a two-machine flow shop.
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• Polynomial-time approximation schemes for scheduling problems with time lags
• Scheduling jobs with fixed start and end times
• Sequencing \(n\) jobs on two machines with arbitrary time lags
• The complexity of satisfiability problems
• The complexity of theorem-proving procedures
• Two-machine open shop scheduling with special transportation times

Cited in

(4)

• scientific article; zbMATH DE number 710498 (Why is no real title available?)
• Algorithms and Computation
• Scheduling in manufacturing with transportation: classification and solution techniques
• On the complexity of open shop scheduling with time lags

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

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