Mathematical programming formulations for machine scheduling: A survey

DOI10.1016/0377-2217(91)90304-EzbMath0734.90040WikidataQ57387911 ScholiaQ57387911MaRDI QIDQ811337

Moshe Dror, Jacek Błażewicz, Jan Weglarz

Publication date: 1991

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

zbMATH Keywords

surveyclassificationMachine scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (36)

MP or not MP: that is the question ⋮ Evolution based learning in a job shop scheduling environment ⋮ Scheduling identical jobs on uniform parallel machines under position-based learning effects ⋮ Scheduling manufacturing systems for delayed product differentiation in agile manufacturing ⋮ Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ Job-shop production scheduling with reverse flows ⋮ Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times ⋮ Modeling the parallel machine scheduling problem with step deteriorating jobs ⋮ A machine-order search space for job-shop scheduling problems ⋮ Evaluation of mathematical models for flexible job-shop scheduling problems ⋮ Simplifying dispatching rules in genetic programming for dynamic job shop scheduling ⋮ A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness ⋮ Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters ⋮ An application of dynamic programming to assign pressing tanks at wineries ⋮ Project scheduling under the threat of catastrophic disruption ⋮ A systematic review of multi-objective hybrid flow shop scheduling ⋮ Application of quantum approximate optimization algorithm to job shop scheduling problem ⋮ A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization ⋮ Towards a Robust Scheduling on Unrelated Parallel Machines: A Scenarios Based Approach ⋮ Optimizing the physician scheduling problem in a large hospital ward ⋮ Minimizing total completion time for preemptive scheduling with release dates and deadline constraints ⋮ Mathematical model applied to single-track line scheduling problem in Brazilian railways ⋮ Minimizing the makespan on two identical parallel machines with mold constraints ⋮ Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration ⋮ Terminal inventory level constraints for online production scheduling ⋮ Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms ⋮ Mixed binary integer programming formulations for the reentrant job shop scheduling problem ⋮ Fast LP models and algorithms for identical jobs on uniform parallel machines ⋮ Complementary column generation and bounding approaches for set partitioning formulations ⋮ Optimal solutions for a dock assignment problem with trailer transportation ⋮ Genetic algorithms and simulated annealing for scheduling in agile manufacturing ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ A study of integer programming formulations for scheduling problems ⋮ Model formulations for the machine scheduling problem with limited waiting time constraints ⋮ New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Scheduling subject to resource constraints: Classification and complexity
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• On the two-phase method for preemptive scheduling
• Surrogate duality relaxation for job shop scheduling
• Geometric algorithms and combinatorial optimization
• Batching to Minimize Flow Times on One Machine
• Minimizing Total Tardiness on One Machine is NP-Hard
• Integer Programming Formulation of Traveling Salesman Problems
• Preemptive Scheduling, Linear Programming and Network Flows
• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
• The Periodic Loading Problem: Formulation And Heuristics
• Preemptive scheduling with staircase and piecewise linear resource availability
• Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
• Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Minimizing Mean Flow Time With Release Time and Deadline Constraints
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Time-Optimal Control of Resource Allocation in a Complex of Operations Framework
• A dual algorithm for the one-machine scheduling problem
• On general routing problems
• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
• Job-Shop Scheduling by Implicit Enumeration
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some simple scheduling algorithms
• Scheduling independent tasks to reduce mean finishing time
• Bounds on Multiprocessing Timing Anomalies
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Mathematical programming formulations for machine scheduling: A survey