A MILP model for then-job,M-stage flowshop with sequence dependent set-up times

DOI10.1080/00207548608919815zbMath0605.90066OpenAlexW2090902243MaRDI QIDQ3743087

Soumen Ghosh, Bellur N. Skrikar

Publication date: 1986

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207548608919815

zbMATH Keywords

flowshopmixed integer linear programComputational resultssequence dependent set-up times

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (18)

Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times ⋮ Unnamed Item ⋮ On the Modeling Tactics of Research Extensions in Production/Operations Management ⋮ An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal ⋮ Scheduling in a sequence dependent setup environment with genetic search ⋮ An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times ⋮ Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times. ⋮ Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. ⋮ A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups ⋮ An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives ⋮ An approximate solution of the flow-shop problem with sequence dependent setup times ⋮ Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics ⋮ Mathematical Modeling of Scheduling Problems ⋮ Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup ⋮ A global MILP model for FMS scheduling ⋮ Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process ⋮ A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times ⋮ Two models for a family of flowshop sequencing problems

Cites Work

• The Truck Dispatching Problem
• Optimal two- and three-stage production schedules with setup times included
• Integer Programming Formulation of Traveling Salesman Problems
• Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
• Balancing Workloads and Minimizing Set-up Costs in the Parallel Processing Shop
• A Production Scheduling Problem with Sequencing Considerations
• A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems
• Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
• An Algorithm for the Traveling Salesman Problem
• The Traveling Salesman Problem: A Survey
• Computational Experience with an M-Salesman Traveling Salesman Algorithm

This page was built for publication: A MILP model for then-job,M-stage flowshop with sequence dependent set-up times