Alternative graph formulation for solving complex factory-scheduling problems

DOI10.1080/00207540210136478MaRDI QIDQ4415989zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The disjunctive graph machine representation of the job shop scheduling problem
• scientific article; zbMATH DE number 1859342
• Job-shop scheduling with processing alternatives.
• Disjunctive graph-based scheduling algorithm for job shop with material handling
• Some graph‐theoretical models for scheduling in automated production systems

Cites work

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

Cited in

(12)

• A tabu search algorithm for scheduling pharmaceutical packaging operations
• A note on disjunctive graph representation
• The disjunctive graph machine representation of the job shop scheduling problem
• Large-scale periodic scheduling in time-sensitive networks
• Disjunctive graph-based scheduling algorithm for job shop with material handling
• Disjunctive graph based acyclic reconfigurable flow shop modeling and optimization
• scientific article; zbMATH DE number 4093162 (Why is no real title available?)
• scientific article; zbMATH DE number 1859342 (Why is no real title available?)
• An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization
• Feasible insertions in job shop scheduling, short cycles and stable sets
• 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

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

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