Comparative evaluation of MILP flowshop models
From MaRDI portal
Recommendations
- New MILP models for the permutation flowshop problem
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
- Two models for a family of flowshop sequencing problems
- A study of integer programming formulations for scheduling problems
- Two MILP models for the N × M SDST flowshop sequencing problem
Cited in
(29)- The distributed permutation flowshop scheduling problem
- Hybrid flexible flowshop problems: models and solution methods
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
- Two models for a family of flowshop sequencing problems
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
- Solving permutation flow shop scheduling problem with sequence-independent setup time
- Mixed integer linear programming models for flow shop scheduling with a demand plan of job types
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- Two MILP models for the N × M SDST flowshop sequencing problem
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
- A study on open shop scheduling to minimise total tardiness
- New effective MILP models for PFSPs arising from real applications
- MILP models for the optimization of real production lines
- A study of integer programming formulations for scheduling problems
- New MILP models for the permutation flowshop problem
- Flow shop scheduling with peak power consumption constraints
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
- On ‘redundant’ constraints in Stafford's MILP model for the flowshop problem
- Polynomial time approximation algorithms for proportionate open-shop scheduling
- Integration of process planning and scheduling with sequence dependent setup time: A case study from electrical wires and power cable industry
- On some lower bounds for the permutation flowshop problem
- Scheduling open shops with parallel machines to minimize total completion time
- A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness
- A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness
- Mip-based local search for permutation flowshop scheduling with makespan objective
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
- Bounds for the permutation flowshop scheduling problem: new framework and theoretical insights
- Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
This page was built for publication: Comparative evaluation of MILP flowshop models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4671552)
