A study of integer programming formulations for scheduling problems
From MaRDI portal
Publication:3124684
Recommendations
- Comparative evaluation of MILP flowshop models
- A new integer programming formulation for the permutation flowshop problem
- Mathematical programming formulations for machine scheduling: A survey
- Mixed integer programming models for job shop scheduling: A computational analysis
- A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
Cites work
- scientific article; zbMATH DE number 4093162 (Why is no real title available?)
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- A Computational Study of the Job-Shop Scheduling Problem
- A Review of Production Scheduling
- A Survey of Scheduling Rules
- A state-of-the-art review of parallel-machine scheduling research
- An Improved Formulation for the Job-Shop Scheduling Problem
- An experimental comparison of solution algorithms for the single-machine tardiness problem
- Flow-shop scheduling with flexible processors
- Letter to the Editor—An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques
- Mathematical programming formulations for machine scheduling: A survey
- Minimizing the Number of Machine Idle Intervals with Minimum Makespan in a Flow-Shop
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Survey of scheduling research involving due date determination decisions
- The schedule-sequencing problem
Cited in
(28)- Hybrid flexible flowshop problems: models and solution methods
- Integer programming approach for schedulability of sporadic real-time systems
- Formal languages for integer programming modeling of shift scheduling problems
- Mathematical programming formulations for machine scheduling: A survey
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
- On some lower bounds for the permutation flowshop problem
- Mixed integer programming models for job shop scheduling: A computational analysis
- GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
- Optimal scheduling for flexible job shop operation
- On the exact solution of the no-wait flow shop problem with due date constraints
- Reformulation and Solution Approaches for an Integrated Scheduling Model
- Evaluation of mathematical models for flexible job-shop scheduling problems
- Model formulations for the machine scheduling problem with limited waiting time constraints
- Scheduling personal finances via integer programming
- Polynomial time approximation algorithms for proportionate open-shop scheduling
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- A new integer programming formulation for the permutation flowshop problem
- New effective MILP models for PFSPs arising from real applications
- Mixed binary integer programming formulations for the reentrant job shop scheduling problem
- Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling
- Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
- Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters
- A study on open shop scheduling to minimise total tardiness
- Comparative evaluation of MILP flowshop models
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- The distributed permutation flowshop scheduling problem
This page was built for publication: A study of integer programming formulations for scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3124684)
