Approximation results for the two-machine job shop under limited machine availability

DOI10.1007/s12597-017-0298-5zbMath1397.90174OpenAlexW2581317306MaRDI QIDQ1788868

Hatem Hadda

Publication date: 9 October 2018

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-017-0298-5

zbMATH Keywords

schedulingapproximation schemesflow shopjob shopavailability constraint

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
• A PTAS for a particular case of the two-machine flow shop with limited machine availability
• An improved algorithm for the two machine flow shop problem with several availability constraints
• A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints
• A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
• 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
• 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
• Two-machine flowshop scheduling with consecutive availability constraints
• NP-hardness of shop-scheduling problems with three jobs
• An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
• An artificial immune algorithm for multiple-route job shop scheduling problem with preventive maintenance constraints
• Optimal two- and three-stage production schedules with setup times included
• An FPTAS for scheduling a two-machine flowshop with one unavailability interval
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Short Shop Schedules
• Two-machine flow shops with limited machine availability