Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
From MaRDI portal
Publication:435728
DOI10.1016/J.DISOPT.2011.11.001zbMATH Open1242.90077OpenAlexW1996135521MaRDI QIDQ435728FDOQ435728
Authors: F. J. Hwang, M. Y. Kovalyov, B. M. T. Lin 
Publication date: 12 July 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2011.11.001
Recommendations
- Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
- Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
- scientific article; zbMATH DE number 4010197
- Two-machine flow-shop scheduling problems with minimizing the total completion times
Cites Work
- Scheduling with batching: A review
- The open shop scheduling problem with a given sequence of jobs on one machine
- Title not available (Why is that?)
- Two‐machine flowshop scheduling with conditional deteriorating second operations
- Batching and scheduling in a multi-machine flow shop
- Scheduling with centralized and decentralized batching policies in concurrent open shops
- Batching decisions for assembly production systems
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- A concise survey of scheduling with time-dependent processing times
- Single-machine scheduling with early and tardy completion costs
- Scheduling batches with sequential job processing for two-machine flow and open shops
- An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions
- Optimal timing of a sequence of tasks with general completion costs
- Minimizing the earliness--tardiness costs on a single machine
- Optimal timing schedules in earliness-tardiness single machine sequencing
- An improved earliness--tardiness timing algorithm
Cited In (14)
- Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
- Relocation scheduling subject to fixed processing sequences
- The total completion time open shop scheduling problem with a given sequence of jobs on one machine
- Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence
- Total completion time minimization in a computer system with a server and two parallel processors
- Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type
- Two-machine flowshop scheduling with job class setups to minimize total flowtime
- A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
- Total completion time minimization scheduling on two hierarchical uniform machines
- Minimizing total completion time in a two-machine flowshop: Analysis of special cases
- Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- Scheduling with centralized and decentralized batching policies in concurrent open shops
- The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
This page was built for publication: Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q435728)
