HEURISTIC ALGORITHMS FOR A SINGLE-MACHINE COMMON DUE DATE ASSIGNMENT UNDER EARLINESS/TARDINESS MEASURE

DOI10.15807/JORSJ.36.121zbMATH Open0797.90046OpenAlexW2264554957MaRDI QIDQ4286352FDOQ4286352

Author name not available (Why is that?)

Publication date: 27 March 1994

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.36.121

Recommendations

• A heuristic for single machine common due date assignment problem with different earliness/tardiness weights
• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
• A heuristic for the single machine tardiness problem
• Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
• Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
• A heuristic for single machine scheduling with early and tardy costs
• Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
• [[:Publication:4761372|Title not available (Why is that?)]]

zbMATH Keywords

heuristicsingle-machine schedulingcommon due datedifferent weightsweighted mean absolute deviation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (2)

• A heuristic for single machine common due date assignment problem with different earliness/tardiness weights
• A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem

This page was built for publication: HEURISTIC ALGORITHMS FOR A SINGLE-MACHINE COMMON DUE DATE ASSIGNMENT UNDER EARLINESS/TARDINESS MEASURE

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