Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments

DOI10.1007/S10951-019-00633-7MaRDI QIDQ2215191zbMATH OpenOpenAlexFDO

Authors Jianming Dong, Joshua Chang, Bing Su, Jueliang Hu, Guohui Lin

Publication date 11 December 2020

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-019-00633-7

zbMATH Keywords

approximation algorithmextended two-stage open shopmultiprocessorschedulingtwo-machine flow shop

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Improved approximation algorithms for two-stage flowshops scheduling problem
• Approximation algorithms for the multiprocessor open shop scheduling problem
• Approximation algorithms on multiple two-stage flowshops
• Approximation algorithms for two-stage flexible flow shop scheduling
• scientific article; zbMATH DE number 1500536

Cites work

• A New Heuristic for Three-Machine Flow Shop Scheduling
• A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan
• An FPTAS for the parallel two-stage flowshop problem
• Approximation algorithms for the parallel flow shop problem
• Bounds for Certain Multiprocessing Anomalies
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1182757 (Why is no real title available?)
• scientific article; zbMATH DE number 1500536 (Why is no real title available?)
• Makespan minimization in open shops: A polynomial time approximation scheme
• Open Shop Scheduling to Minimize Finish Time
• Optimal two- and three-stage production schedules with set-up time included
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Short Shop Schedules
• The Complexity of Flowshop and Jobshop Scheduling
• The hybrid flow shop scheduling problem
• Two-Stage, Hybrid Flowshop Scheduling Problem

Cited in

(4)

• Flow shop and open shop scheduling with a critical machine and two operations per job
• A 3/2 algorithm for two-machine open shop with route-dependent processing times
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage

This page was built for publication: Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments

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