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

DOI10.1007/S10878-012-9485-8MaRDI QIDQ386427zbMATH OpenOpenAlexFDO

Authors Jianming Dong, Yong Chen, An Zhang, Qifan 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

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

Recommendations

• Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
• A New Heuristic for Three-Machine Flow Shop Scheduling
• NP-hardness of shop-scheduling problems with three jobs
• Approximation Algorithms for Three-Machine Open Shop Scheduling
• A polynomial algorithm for the three-machine open shop with a bottleneck machine

Cites work

• scientific article; zbMATH DE number 1500536 (Why is no real title available?)
• A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
• Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
• Approximation algorithms for the multiprocessor open shop scheduling problem
• Complexity of mixed shop scheduling problems: A survey
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Global lower bounds for flow shops with multiple processors
• Heuristics for scheduling in a flow shop with multiple processors
• Open Shop Scheduling to Minimize Finish Time
• Optimal two- and three-stage production schedules with set-up time included
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• The Complexity of Flowshop and Jobshop Scheduling
• The hybrid flow shop scheduling problem
• The mixed shop scheduling problem
• Two-Machine Super-Shop Scheduling Problem
• Worst-case analysis of heuristics for open shops with parallel machines

Cited in

(7)

• Approximation algorithms for the three-machine proportionate mixed shop scheduling
• Predictive-reactive scheduling for single surgical suite subject to random emergency surgery
• Three-machine flow shop scheduling with overlapping waiting time constraints
• Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
• Exact exponential algorithms for 3-machine flowshop scheduling problems
• scientific article; zbMATH DE number 5052107 (Why is no real title available?)
• Three-machine shop scheduling with partially ordered processing routes

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

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