Two-machine flow shop scheduling with an operator non-availability period to minimize makespan

DOI10.1007/s10878-020-00548-6zbMath1442.90077OpenAlexW3007749485MaRDI QIDQ2175049

Dawei Li, Xi-wen Lu

Publication date: 27 April 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00548-6

zbMATH Keywords

approximation algorithmworst-case analysisflow shop schedulingoperator non-availability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items

Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity

Cites Work

• Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
• Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
• Approximation results for flow shop scheduling problems with machine availability constraints
• An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
• Operator non-availability periods
• Two-machine flowshop scheduling with availability constraints
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
• An improved heuristic for two-machine flowshop scheduling with an availability constraint
• Single-machine scheduling with operator non-availability to minimize total weighted completion time
• An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
• Single machine scheduling with small operator-non-availability periods
• Optimal two- and three-stage production schedules with setup times included