Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
From MaRDI portal
Publication:852963
DOI10.1016/J.EJOR.2005.09.030zbMATH Open1110.90036OpenAlexW2013982419MaRDI QIDQ852963FDOQ852963
Suk-Hun Yoon, Byung-Cheon Choi, Sung-Jin Chung
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.030
Recommendations
- Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
- The three-machine proportionate flow shop problem with unequal machine speeds
- Minimizing total weighted completion time in a proportionate flow shop
- Proportionate flow shop with controllable processing times
- Proportionate flowshops with general position-dependent processing times
Cites Work
- Title not available (Why is that?)
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- Short Shop Schedules
- Flowshop sequencing problem with ordered processing time matrices: A general case
- Some results of the worst-case analysis for flow shop scheduling
- Focused Scheduling in Proportionate Flowshops
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Minimizing total weighted completion time in a proportionate flow shop
- The three-machine proportionate flow shop problem with unequal machine speeds
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- New results in the worst-case analysis for flow-shop scheduling
Cited In (20)
- The just-in-time scheduling problem in a flow-shop scheduling system
- A survey on offline scheduling with rejection
- Minimizing makespan in an ordered flow shop with machine-dependent processing times
- A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem
- A note on the proportionate flow shop with a bottleneck machine
- Two-machine flow shop scheduling problem with an outsourcing option
- An upper bound for the inter-exit time of two jobs in an \(m\)-machine flow shop
- Focused Scheduling in Proportionate Flowshops
- Proportionate flow shop with controllable processing times
- The three-machine proportionate flow shop problem with unequal machine speeds
- Flow shops with machine maintenance: ordered and proportionate cases
- Hybrid flowshop scheduling with machine and resource-dependent processing times
- A high performing metaheuristic for multi-objective flowshop scheduling problem
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
- Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
- No-wait flow shop scheduling using fuzzy multi-objective linear programming
- Proportionate flow shop: New complexity results and models with due date assignment
- A note on makespan minimization in proportionate flow shops
- Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
This page was built for publication: Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852963)
