Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic
From MaRDI portal
Publication:709121
DOI10.1016/j.cor.2010.04.009zbMath1231.90208MaRDI QIDQ709121
Xiangyong Li, Yash P. Aneja, Mohammed Fazle Baki
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.04.009
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90B80: Discrete location and assignment
Related Items
Cites Work
- Scheduling a single server in a two-machine flow shop
- Parallel machine scheduling problems with a single server
- Approximation algorithms for two-machine flow shop scheduling with batch setup times
- One-operator-two-machine flowshop scheduling with setup and dismounting times
- Parallel machine scheduling with a common server
- Complexity results for flow-shop problems with a single server
- Complexity results for parallel machine problems with a single server
- Scheduling with batching: A review
- Scheduling the production of two-component jobs on a single machine
- A survey of scheduling problems with setup times or costs
- Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
- One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective
- A note on scheduling alternative operations in two-machine flowshops
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- One-Operator, Two-Machine Open Shop And Flow Shop Scheduling With Setup Times For Machines And Maximum Lateness Objective
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
