Extension of disjunctive graph model for job shop scheduling problem

MaRDI QIDQ4789912zbMATH OpenFDO

Authors Jacek Blazewicz, Erwin Pesch, Małgorzata Sterna

Publication date 23 April 2003

zbMATH Keywords

job shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• The disjunctive graph machine representation of the job shop scheduling problem
• A note on disjunctive graph representation
• scientific article; zbMATH DE number 1175395
• Alternative graph formulation for solving complex factory-scheduling problems
• Disjunctive graph-based scheduling algorithm for job shop with material handling

Cited in

(6)

• A note on disjunctive graph representation
• The disjunctive graph machine representation of the job shop scheduling problem
• 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 1175395 (Why is no real title available?)
• Alternative graph formulation for solving complex factory-scheduling problems

This page was built for publication: Extension of disjunctive graph model for job shop scheduling problem

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