Alternative graph formulation for solving complex factory-scheduling problems

DOI10.1080/00207540210136478zbMath1032.90013OpenAlexW2072203764MaRDI QIDQ4415989

Dario Pacciarelli

Publication date: 7 August 2003

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540210136478

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Feasible insertions in job shop scheduling, short cycles and stable sets ⋮ Large-scale periodic scheduling in time-sensitive networks ⋮ An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization ⋮ A new neighborhood and tabu search for the blocking job shop ⋮ MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry ⋮ A tabu search algorithm for scheduling pharmaceutical packaging operations

Cites Work

• Practical job shop scheduling
• A three-dimensional matching model for perishable production scheduling
• A branch and bound algorithm for the job-shop scheduling problem
• Adjustment of heads and tails for the job-shop problem
• Shop scheduling problems under precedence constraints
• A mathematical programming model for scheduling steelmaking-continuous casting production
• Applying tabu search to the job-shop scheduling problem
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Perishable Inventory Theory: A Review
• Disjunctive Programming
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: Alternative graph formulation for solving complex factory-scheduling problems