Two-machine flowshop scheduling with job class setups to minimize total flowtime
From MaRDI portal
Publication:1781550
DOI10.1016/j.cor.2004.04.002zbMath1071.90021OpenAlexW2067203337MaRDI QIDQ1781550
Xiuli Wang, Cheng, T. C. Edwin
Publication date: 27 June 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/1153
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A comprehensive review of flowshop group scheduling literature ⋮ Machine scheduling with job class setup and delivery considerations ⋮ Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling ⋮ Batch-size-based rearrangement of the shop floor into mini-lines ⋮ A survey of scheduling problems with setup times or costs ⋮ Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines
Cites Work
- Unnamed Item
- Unnamed Item
- Single facility multi-class job scheduling
- Optimal schedules for single facility with two job classes
- Single facility scheduling with multiple job classes
- Scheduling two job classes on a single machine
- Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
- Flowshop scheduling with dominant machines
- Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
- Scheduling with batching: A review
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Scheduling Groups of Jobs on a Single Machine
