Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type
From MaRDI portal
(Redirected from Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type)
Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
Recommendations
- Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
- Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
- Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage
- Minimizing total completion time in two-stage hybrid flow shop with dedicated machines
- scientific article; zbMATH DE number 5732579
Cites work
- Batching and scheduling in a multi-machine flow shop
- Comments on Flow shop and open shop scheduling with a critical machine and two operations per job
- Flow shop and open shop scheduling with a critical machine and two operations per job
- scientific article; zbMATH DE number 1437089 (Why is no real title available?)
- Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine
- Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
- The open shop scheduling problem with a given sequence of jobs on one machine
- Two‐machine flowshop scheduling with conditional deteriorating second operations
Cited in
(9)- Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
- Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines
- Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence
- Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
- Relocation scheduling subject to fixed processing sequences
- A heuristic method for two-stage hybrid flow shop with dedicated machines
- Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
- Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence
- Sequencing with learning, forgetting and task similarity
This page was built for publication: Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944074)