Three-machine shop scheduling with partially ordered processing routes

DOI10.1057/PALGRAVE/JORS/2601329MaRDI QIDQ4656657zbMATH OpenOpenAlexFDO

Authors Inna G. Drobouchevitch, N. V. Shakhlevich, V. A. Strusevich

Publication date 14 March 2005

Full work available at URL https://doi.org/10.1057/palgrave/jors/2601329

zbMATH Keywords

approximation algorithmshop schedulingworst-case analysis

Mathematics Subject Classification ID

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

Recommendations

• A New Heuristic for Three-Machine Flow Shop Scheduling
• scientific article; zbMATH DE number 894722
• A new three-machine shop scheduling: complexity and approximation algorithm
• scientific article; zbMATH DE number 894720
• The three-machine proportionate open shop and mixed shop minimum makespan problems

Cited in

(5)

• Three-machine flow shop scheduling with overlapping waiting time constraints
• An effective heuristic algorithm for the partial shop scheduling problem
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Approximation algorithms for the three-machine proportionate mixed shop scheduling
• scientific article; zbMATH DE number 894720 (Why is no real title available?)

This page was built for publication: Three-machine shop scheduling with partially ordered processing routes

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