Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs

DOI10.1002/(SICI)1520-6750(199704)44:3%3C287::AID-NAV4%3E3.0.CO;2-4zbMATH Open0890.90100OpenAlexW2034026395MaRDI QIDQ4367301FDOQ4367301

Authors: Awi Federgruen, Gur Mosheiov 

Publication date: 25 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199704)44:3%3C287::aid-nav4%3E3.0.co;2-4

Recommendations

• Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
• Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
• A heuristic for single machine scheduling with early and tardy costs
• Heuristics for minimizing mean tardiness form parallel machines
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
• A heuristic for scheduling general job shops to minimize maximum lateness
• Multiple-machine scheduling with earliness, tardiness and completion time penalties
• Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem
• Minmax scheduling with job-classes and earliness-tardiness costs

zbMATH Keywords

parallel machinesworst-case boundsmaximum earliness or tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (16)

• Hierarchical production planning and scheduling in a multi-product, batch process environment
• Due-date assignment on uniform machines
• Parallel machine scheduling with a common due window
• A common due-data assignment problem on parallel identical machines
• Minmax scheduling with job-classes and earliness-tardiness costs
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
• Scheduling job classes on uniform machines
• Improved heuristics for the early/tardy scheduling problem with no idle time
• Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
• Minimizing maximum earliness on parallel identical machines
• Minmax earliness-tardiness costs with unit processing time jobs
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
• A note on the SPT heuristic for solving scheduling problems with generalized due dates
• Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
• A heuristic for scheduling general job shops to minimize maximum lateness
• A note on a due-date assignment on a two-machine flow-shop

This page was built for publication: Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs

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