Comparative evaluation of MILP flowshop models

DOI10.1057/palgrave.jors.2601805zbMath1122.90359OpenAlexW2002917695MaRDI QIDQ4671552

Edward F. jun. Stafford, Jatinder N. D. Gupta, F. T. Tseng

Publication date: 26 April 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601805

zbMATH Keywords

integer programmingflowshop schedulingempirical evaluationmodel complexityManne modelsWagner models

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (19)

New effective MILP models for PFSPs arising from real applications ⋮ MILP models for the optimization of real production lines ⋮ Hybrid flexible flowshop problems: models and solution methods ⋮ Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness ⋮ Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling ⋮ Flow shop scheduling with peak power consumption constraints ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ Solving permutation flow shop scheduling problem with sequence-independent setup time ⋮ Scheduling open shops with parallel machines to minimize total completion time ⋮ On some lower bounds for the permutation flowshop problem ⋮ Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness ⋮ Integration of Process Planning and Scheduling with Sequence Dependent Setup Time: A Case Study from Electrical Wires and Power Cable Industry ⋮ A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness ⋮ A study on open shop scheduling to minimise total tardiness ⋮ Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date ⋮ Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness ⋮ The distributed permutation flowshop scheduling problem ⋮ Polynomial time approximation algorithms for proportionate open‐shop scheduling

This page was built for publication: Comparative evaluation of MILP flowshop models