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.030zbMath1110.90036OpenAlexW2013982419MaRDI QIDQ852963
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
Related Items (15)
A high performing metaheuristic for multi-objective flowshop scheduling problem ⋮ A survey on offline scheduling with rejection ⋮ Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system ⋮ Minimizing makespan in an ordered flow shop with machine-dependent processing times ⋮ Two-machine flow shop scheduling problem with an outsourcing option ⋮ The just-in-time scheduling problem in a flow-shop scheduling system ⋮ A note on makespan minimization in proportionate flow shops ⋮ A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop ⋮ A note on the proportionate flow shop with a bottleneck machine ⋮ Hybrid flowshop scheduling with machine and resource-dependent processing times ⋮ No-wait flow shop scheduling using fuzzy multi-objective linear programming ⋮ Flow shops with machine maintenance: ordered and proportionate cases ⋮ A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems ⋮ A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem ⋮ Proportionate flow shop: New complexity results and models with due date assignment
Cites Work
- Unnamed Item
- Unnamed Item
- New results in the worst-case analysis for flow-shop scheduling
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- Minimizing total weighted completion time in a proportionate flow shop
- Some results of the worst-case analysis for flow shop scheduling
- The three-machine proportionate flow shop problem with unequal machine speeds
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Focused Scheduling in Proportionate Flowshops
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- Flowshop sequencing problem with ordered processing time matrices: A general case
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Short Shop Schedules
This page was built for publication: Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
