The disjunctive graph machine representation of the job shop scheduling problem

DOI10.1016/S0377-2217(99)00486-5zbMath0990.90035OpenAlexW2076402732WikidataQ57387843 ScholiaQ57387843MaRDI QIDQ1590037

Jacek Błażewicz, Małgorzata Sterna, Erwin Pesch

Publication date: 19 August 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00486-5

zbMATH Keywords

graph representationsgraph matrix

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Scheduling of a job-shop problem with limited output buffers ⋮ Scheduling the truckload operations in automatic warehouses ⋮ Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints ⋮ Depth-first heuristic search for the job shop scheduling problem ⋮ Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling ⋮ An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents ⋮ Application of quantum approximate optimization algorithm to job shop scheduling problem ⋮ Problem difficulty for tabu search in job-shop scheduling

Cites Work

• A survey of priority rule-based scheduling
• The job-shop problem and immediate selection
• Adjustment of heads and tails for the job-shop problem
• Unnamed Item
• Unnamed Item

This page was built for publication: The disjunctive graph machine representation of the job shop scheduling problem