A new approach to computing optimal schedules for the job-shop scheduling problem
From MaRDI portal
Publication:4645937
DOI10.1007/3-540-61310-2_29zbMATH Open1414.90162OpenAlexW1610326124MaRDI QIDQ4645937FDOQ4645937
Authors:
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
Recommendations
- A Computational Study of the Job-Shop Scheduling Problem
- The job shop scheduling problem: Conventional and new solution techniques
- An optimal method for the preemptive job shop scheduling problem
- A Novel Heuristic Approach for Job Shop Scheduling Problem
- scientific article; zbMATH DE number 1982190
- A new lower bound for the job-shop scheduling problem
- Solving the job-shop scheduling problem optimally by dynamic programming
- scientific article; zbMATH DE number 6378894
- Optimal job scheduling for flowshops
- Better approximation guarantees for job-shop scheduling
Cites Work
- A Computational Study of the Job-Shop Scheduling Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- A time indexed formulation of non-preemptive single machine scheduling problems
- The Complexity of Flowshop and Jobshop Scheduling
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A branch and bound algorithm for the job-shop scheduling problem
- An Algorithm for Solving the Job-Shop Problem
- Surrogate duality relaxation for job shop scheduling
- Job Shop Scheduling by Local Search
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Adjustment of heads and tails for the job-shop problem
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- On the facial structure of scheduling polyhedra
- On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem
Cited In (47)
- Constraint propagation techniques for the disjunctive scheduling problem
- A study on the enhanced best performance algorithm for the just-in-time scheduling problem
- An Algorithm for Solving the Job-Shop Problem
- Title not available (Why is that?)
- Improving job-shop schedules through critical pairwise exchanges
- Improving branch and bound for jobshop scheduling with constraint propagation
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- Permutation-induced acyclic networks for the job shop scheduling problem
- A neighborhood for complex job shop scheduling problems with regular objectives
- Local adjustments: A general algorithm
- An exact algorithm for an integrated project staffing problem with a homogeneous workforce
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
- A Computational Study of the Job-Shop Scheduling Problem
- Neighborhood singleton consistencies
- Constraint reasoning
- On not-first/not-last conditions in disjunctive scheduling
- An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective
- Evaluation of a new decision-aid parameter for job shop scheduling under uncertainties
- From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
- Minimizing L max for large-scale, job-shop scheduling problems
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Scheduling and constraint propagation
- A branch and bound algorithm for the job-shop scheduling problem
- Solving the job-shop scheduling problem optimally by dynamic programming
- Title not available (Why is that?)
- Resource leveling in a machine environment
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- The job shop scheduling problem: Conventional and new solution techniques
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley
- A linear programming-based method for job shop scheduling
- Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
- A filter-and-fan approach to the job shop scheduling problem
- Title not available (Why is that?)
- An optimal method for the preemptive job shop scheduling problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Domain reduction techniques for global NLP and MINLP optimization
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
- Job-shop scheduling with blocking and no-wait constraints
- Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case
Uses Software
This page was built for publication: A new approach to computing optimal schedules for the job-shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645937)
