A new three-machine shop scheduling: complexity and approximation algorithm

DOI10.1007/S10878-012-9485-8zbMath1282.90066OpenAlexW2019094391MaRDI QIDQ386427

Jianming Dong, Yong Chen, An Zhang, Qi-Fan Yang

Publication date: 9 December 2013

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

Full work available at URL: https://doi.org/10.1007/s10878-012-9485-8

zbMATH Keywords

approximation algorithmflow shopopen shopworst-case analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Predictive-reactive scheduling for single surgical suite subject to random emergency surgery

Cites Work

• Unnamed Item
• The mixed shop scheduling problem
• Global lower bounds for flow shops with multiple processors
• A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
• Approximation algorithms for the multiprocessor open shop scheduling problem
• Worst-case analysis of heuristics for open shops with parallel machines
• Heuristics for scheduling in a flow shop with multiple processors
• Complexity of mixed shop scheduling problems: A survey
• The hybrid flow shop scheduling problem
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• Optimal two- and three-stage production schedules with setup times included
• Two-Machine Super-Shop Scheduling Problem
• Open Shop Scheduling to Minimize Finish Time
• Flowshop and Jobshop Schedules: Complexity and Approximation
• The Complexity of Flowshop and Jobshop Scheduling
• Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage

This page was built for publication: A new three-machine shop scheduling: complexity and approximation algorithm