A new approach to computing optimal schedules for the job-shop scheduling problem

DOI10.1007/3-540-61310-2_29zbMath1414.90162OpenAlexW1610326124MaRDI QIDQ4645937

No author found.

Publication date: 11 January 2019

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61310-2_29

zbMATH Keywords

optimal scheduleprocessing windowfeasibility problemfractional packingfeasible schedule

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

An exact algorithm for an integrated project staffing problem with a homogeneous workforce, Solving the job-shop scheduling problem optimally by dynamic programming, Resource leveling in a machine environment, Domain reduction techniques for global NLP and MINLP optimization, Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics, Exact algorithms for OWA-optimization in multiobjective spanning tree problems, Scheduling and constraint propagation, Local adjustments: A general algorithm, An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach, Resource-constrained project scheduling: Notation, classification, models, and methods, The job shop scheduling problem: Conventional and new solution techniques, Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates, Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case, Neighborhood singleton consistencies, Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem, Constraint propagation techniques for the disjunctive scheduling problem, Job-shop scheduling with blocking and no-wait constraints, On not-first/not-last conditions in disjunctive scheduling, A branch and bound to minimize the number of late jobs on a single machine with release time constraints

Uses Software

• JOBSHOP

Cites Work

• A practical use of Jackson's preemptive schedule for solving the job shop problem
• Surrogate duality relaxation for job shop scheduling
• A time indexed formulation of non-preemptive single machine scheduling problems
• A branch and bound algorithm for the job-shop scheduling problem
• Adjustment of heads and tails for the job-shop problem
• On the facial structure of scheduling polyhedra
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• A Computational Study of the Job-Shop Scheduling Problem
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Fast Approximation Algorithms for Fractional Packing and Covering Problems
• On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/F_max) problem
• Job Shop Scheduling by Local Search