A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
The problem of an n-job, M-stage flowshop with sequence dependent set-up times is discussed. A mixed integer linear program (MILP) is formulated with a considerably reduced number of integer binary variables, than if the same problem were formulated with integer variables defined as \(X_{ij}=1\) if job i is sequenced immediately before job j, and 0 otherwise. The inclusion of set-up times, sequence dependency and M stages makes this formulation different from most other flowshop formulations in the literature, since such problems have not been given due consideration. This paper contributes a unique formulation to handle flowshop problems in the process industry where the set-up times have a definite dependence on the sequence in which jobs are processed. Computational results have been compared for problems up to six jobs and stages where the objective has been to minimize the makespan. The MILP has been solved using te SCICONIC-V/M mixed integer solution package on the Prime-550 minicomputer.
- Two MILP models for the N × M SDST flowshop sequencing problem
- An approximate solution of the flow-shop problem with sequence dependent setup times
- A MILP model for an extended version of the flexible job shop problem
- A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times
- Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- New MILP models for the permutation flowshop problem
- Scheduling job shop problems with sequence-dependent setup times
- scientific article; zbMATH DE number 4074791
- Solving the flexible job shop scheduling problem with sequence-dependent setup times
- A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems
- A Production Scheduling Problem with Sequencing Considerations
- An Algorithm for the Traveling Salesman Problem
- Balancing Workloads and Minimizing Set-up Costs in the Parallel Processing Shop
- Computational Experience with an M-Salesman Traveling Salesman Algorithm
- Integer Programming Formulation of Traveling Salesman Problems
- Optimal two- and three-stage production schedules with set-up time included
- Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- The Traveling Salesman Problem: A Survey
- The truck dispatching problem
- A global MILP model for FMS scheduling
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- 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
- 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.
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- Two models for a family of flowshop sequencing problems
- A MILP model for an extended version of the flexible job shop problem
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
- Two MILP models for the N × M SDST flowshop sequencing problem
- An approximate solution of the flow-shop problem with sequence dependent setup times
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
- Mathematical Modeling of Scheduling Problems
- Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
- scientific article; zbMATH DE number 1389747 (Why is no real title available?)
- On the Modeling Tactics of Research Extensions in Production/Operations Management
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
This page was built for publication: A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3743087)