Two-machine flow shop problems with a single server

DOI10.1007/s10951-006-8787-zzbMath1154.90470OpenAlexW2081097282MaRDI QIDQ880567

Brian Rodrigues, Andrew E. B. 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

HeuristicsFlow shopMachine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Two-machine open shop problem with a single server and set-up time considerations ⋮ Parallel machine scheduling with multiple unloading servers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Some efficient heuristic methods for the flow shop sequencing problem
• The two-machine sequence dependent flowshop scheduling problem
• A new heuristic method for the flow shop sequencing problem
• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
• Modified simulated annealing algorithms for the flow shop sequencing problem
• A tabu search approach for the flow shop scheduling problem
• One-operator-two-machine flowshop scheduling with setup and dismounting times
• Complexity results for flow-shop problems with a single server
• Optimal two- and three-stage production schedules with setup times included
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Tabu Search—Part I
• Tabu Search—Part II
• The Complexity of Flowshop and Jobshop Scheduling
• 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

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