Two-machine interval shop scheduling with time lags

DOI10.1007/S10951-013-0336-YzbMATH Open1328.90063OpenAlexW1979469095MaRDI QIDQ892834FDOQ892834

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

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

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

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

Cited In (4)

• Algorithms and Computation
• Title not available (Why is that?)
• 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)