Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
From MaRDI portal
Publication:852963
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
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Flowshop sequencing problem with ordered processing time matrices: A general case
- Focused Scheduling in Proportionate Flowshops
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Minimizing total weighted completion time in a proportionate flow shop
- New results in the worst-case analysis for flow-shop scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Short Shop Schedules
- Some results of the worst-case analysis for flow shop scheduling
- The three-machine proportionate flow shop problem with unequal machine speeds
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
Cited in
(23)- An upper bound for the inter-exit time of two jobs in an \(m\)-machine flow shop
- A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem
- Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times
- Flow shops with machine maintenance: ordered and proportionate cases
- A note on the proportionate flow shop with a bottleneck machine
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
- Two-machine flow shop scheduling problem with an outsourcing option
- Focused Scheduling in Proportionate Flowshops
- No-wait flow shop scheduling using fuzzy multi-objective linear programming
- Minimizing makespan in an ordered flow shop with machine-dependent processing times
- Proportionate flow shop with controllable processing times
- Hybrid flowshop scheduling with machine and resource-dependent processing times
- On equivalence between the proportionate flow shop and single-machine scheduling problems
- The three-machine proportionate flow shop problem with unequal machine speeds
- The just-in-time scheduling problem in a flow-shop scheduling system
- Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
- Proportionate flow shop: new complexity results and models with due date assignment
- A note on makespan minimization in proportionate flow shops
- A high performing metaheuristic for multi-objective flowshop scheduling problem
- A survey on offline scheduling with rejection
- A note: minimizing maximum earliness on a proportionate flowshop
- 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
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)
