Two models for a family of flowshop sequencing problems

DOI10.1016/S0377-2217(01)00320-4zbMath1082.90530OpenAlexW2013303203MaRDI QIDQ1848365

F. T. Tseng, Edward F. jun. Stafford

Publication date: 20 November 2002

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00320-4

zbMATH Keywords

SchedulingFlowshopSequence-dependentNo intermediate queues

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items

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 ⋮ A comprehensive review of flowshop group scheduling literature ⋮ Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling ⋮ Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints ⋮ A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness ⋮ Modeling realistic hybrid flexible flowshop scheduling problems ⋮ A survey of scheduling problems with setup times or costs ⋮ An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives ⋮ Mathematical models for preemptive shop scheduling problems ⋮ Flowshop-scheduling problems with makespan criterion: a review

Uses Software

• LINDO

Cites Work

• Unnamed Item
• Unnamed Item
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
• Two MILP models for the N × M SDST flowshop sequencing problem
• Optimal two- and three-stage production schedules with setup times included
• A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
• On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
• Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues