Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
From MaRDI portal
Publication:2488240
DOI10.1016/j.orl.2004.08.007zbMath1090.90085MaRDI QIDQ2488240
Seyed M. R. Iravani, C. P. Teo
Publication date: 25 August 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.08.007
90B35: Deterministic scheduling theory in operations research
Related Items
Dynamic control of a flexible server in an assembly-type queue with setup costs, Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic, Single-server parallel-machine scheduling with loading and unloading times, A survey of scheduling problems with setup times or costs, Parallel Machine Scheduling with a Single Server: Loading and Unloading
Cites Work
- Unnamed Item
- Job-shop scheduling with multi-purpose machines
- Complexity of scheduling problems with multi-purpose machines
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
- The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem
- Operations and Shipment Scheduling of a Batch on a Flexible Machine
- From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
- Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
- The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler