A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
From MaRDI portal
Publication:3743087
Recommendations
- 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
Cites work
- 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
Cited in
(20)- 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)
