Minimizing makespan in an ordered flow shop with machine-dependent processing times
DOI10.1007/S10878-010-9330-XzbMATH Open1236.90050OpenAlexW2036567471MaRDI QIDQ411247FDOQ411247
Authors: Byung-Cheon Choi, Michael L. Pinedo, Joseph Y.-T. Leung 
Publication date: 4 April 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9330-x
Recommendations
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- Makespan minimization in machine dominated flowshop
- On the Minimization of the Makespan Subject to Flowtime Optimality
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
- Minimizing the makespan in a 2-machine flowshop with time lags and setup conditions
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
- Minimizing makespan on an \(m\)-machine re-entrant flowshop
- scientific article; zbMATH DE number 1437089
- Minimising makespan in the two-machine flow-shop with release times
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- A survey of scheduling with controllable processing times
- An efficient algorithm for determining the convex hull of a finite planar set
- The Complexity of Flowshop and Jobshop Scheduling
- Title not available (Why is that?)
- Time-dependent scheduling
- Faster algorithms for the shortest path problem
- A state-of-the-art review on scheduling with learning effects
- Flowshop sequencing problem with ordered processing time matrices: A general case
- Flowshop-scheduling problems with makespan criterion: a review
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
- Minimizing total completion time in a two-machine flowshop: Analysis of special cases
- Focused Scheduling in Proportionate Flowshops
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- Minimizing total weighted completion time in a proportionate flow shop
- The three-machine proportionate flow shop problem with unequal machine speeds
- Ordered Flow Shop Problems with no In-Process Waiting: Further Results
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- A note on the proportionate flow shop with a bottleneck machine
Cited In (8)
- Minimizing makespan and throughput times at Aalsmeer flower auction
- Makespan minimization in machine dominated flowshop
- Two-machine flow shop scheduling problem with an outsourcing option
- Outsourcing decisions in \(m\)-machine permutation flow shop scheduling problems with machine-dependent processing times
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- Predictive-reactive scheduling for single surgical suite subject to random emergency surgery
- Minimizing flow time in a flow-line manufacturing cell with family setup times
- Proportionate flowshops with general position-dependent processing times
This page was built for publication: Minimizing makespan in an ordered flow shop with machine-dependent processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411247)
