An optimal method for the preemptive job shop scheduling problem

DOI10.1016/J.COR.2012.12.004MaRDI QIDQ502444zbMATH OpenOpenAlexFDO

Authors Abbas Ebadi, G. Moslehi

Publication date 5 January 2017

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2012.12.004

zbMATH Keywords

preemptionschedulingbranch and boundjob shopdisjunctive graph

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Preemptive job-shop scheduling problems with a fixed number of jobs
• A new approach to computing optimal schedules for the job-shop scheduling problem
• On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
• A practical use of Jackson's preemptive schedule for solving the job shop problem
• Resource constraints for preemptive job-shop scheduling
• Solving the job-shop scheduling problem optimally by dynamic programming
• Optimization based job shop scheduling
• An effective hybrid optimization strategy for job-shop scheduling problems
• Properties of optimal schedules in preemptive shop scheduling
• Optimal scheduling for flexible job shop operation

Cited in

(12)

• Mathematical models for preemptive shop scheduling problems
• Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
• A new approach to computing optimal schedules for the job-shop scheduling problem
• scientific article; zbMATH DE number 5547872 (Why is no real title available?)
• A Precedence Graph Algorithm for the Shop Scheduling Problem
• Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
• A machine-order search space for job-shop scheduling problems
• Reduction of job-shop problems to flow-shop problems with precedence constraints
• Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem
• Dynamic model and optimal scheduling algorithm for a set of jobs with preemption constraints
• A linear programming-based method for job shop scheduling
• A practical use of Jackson's preemptive schedule for solving the job shop problem

This page was built for publication: An optimal method for the preemptive job shop scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q502444)