Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
From MaRDI portal
Publication:1944074
DOI10.1016/j.ipl.2010.11.021zbMath1260.90091OpenAlexW2032285979MaRDI QIDQ1944074
Feng-Jang Hwang, Bertrand M. T. Lin
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.11.021
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (6)
Relocation scheduling subject to fixed processing sequences ⋮ Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time ⋮ Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines ⋮ A heuristic method for two-stage hybrid flow shop with dedicated machines ⋮ Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence ⋮ Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence
Cites Work
- Unnamed Item
- Batching and scheduling in a multi-machine flow shop
- Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
- Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine
- Flow shop and open shop scheduling with a critical machine and two operations per job
- Comments on Flow shop and open shop scheduling with a critical machine and two operations per job
- The open shop scheduling problem with a given sequence of jobs on one machine
- Two‐machine flowshop scheduling with conditional deteriorating second operations
This page was built for publication: Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
