A job shop scheduling heuristic for varying reward structures

DOI10.1016/J.MCM.2005.09.021zbMath1090.90071OpenAlexW2091357770MaRDI QIDQ815476

E. Akcora, Scott E. Grasman, Can Saygin

Publication date: 16 February 2006

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2005.09.021

zbMATH Keywords

heuristicsschedulingresource allocationjob shoprewardpenalty index

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• A Broader View of the Job-Shop Scheduling Problem

This page was built for publication: A job shop scheduling heuristic for varying reward structures