Two-machine flow shop problems with a single server

DOI10.1007/S10951-006-8787-ZMaRDI QIDQ880567zbMATH OpenOpenAlexFDO

Authors Brian Rodrigues, Andrew Lim, Cai-Xia Wang

Publication date 15 May 2007

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

Full work available at URL https://doi.org/10.1007/s10951-006-8787-z

zbMATH Keywords

Flow shopHeuristicsMachine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling a single server in a two-machine flow shop
• The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
• Heuristics for the two-machine scheduling problem with a single server
• Complexity results for flow-shop problems with a single server
• Scheduling for parallel dedicated machines with a single server

Cites work

• A new heuristic method for the flow shop sequencing problem
• A tabu search approach for the flow shop scheduling problem
• Complexity results for flow-shop problems with a single server
• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
• Modified simulated annealing algorithms for the flow shop sequencing problem
• One-operator-two-machine flowshop scheduling with setup and dismounting times
• Optimal two- and three-stage production schedules with set-up time included
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• Scheduling for parallel dedicated machines with a single server
• Scheduling parallel machines with a single server: Some solvable cases and heuristics
• Some efficient heuristic methods for the flow shop sequencing problem
• Tabu Search—Part I
• Tabu Search—Part II
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• The Complexity of Flowshop and Jobshop Scheduling
• The two-machine sequence dependent flowshop scheduling problem
• Two-Stage, Hybrid Flowshop Scheduling Problem

Cited in

(9)

• Complexity results for flow-shop problems with a single server
• The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
• Dual processes to solve single server systems
• Two-machine open shop problem with a single server and set-up time considerations
• Heuristics for the two-machine scheduling problem with a single server
• scientific article; zbMATH DE number 1839523 (Why is no real title available?)
• Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times
• Robotic flow shop scheduling problem with combined buffer conditions
• Parallel machine scheduling with multiple unloading servers

This page was built for publication: Two-machine flow shop problems with a single server

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