A permutation-based approach for solving the job-shop problem

DOI10.1023/A:1009757726572zbMath0899.90114OpenAlexW2087788489MaRDI QIDQ1370981

Jianyang Zhou

Publication date: 17 November 1998

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009757726572

zbMATH Keywords

constraint programmingjob-shop schedulingpermutation-based scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Computing leximin-optimal solutions in constraint networks ⋮ Dulmage-Mendelsohn canonical decomposition as a generic pruning technique ⋮ Experiments with the “Oregon Trail Knapsack Problem”

This page was built for publication: A permutation-based approach for solving the job-shop problem