Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs

DOI10.1287/OPRE.45.1.66zbMATH Open0892.90100OpenAlexW2146665054MaRDI QIDQ4367265FDOQ4367265

Awi Federgruen, Gur Mosheiov

Publication date: 25 November 1997

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/734f1dbf2b64233743ea60653dd7f475bb6cdeb7

zbMATH Keywords

single machine schedulingcommon due-date

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (7)

• EA/G-GA for single machine scheduling problems with earliness/tardiness costs
• Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties
• Single-machine common due date total earliness/tardiness scheduling with machine unavailability
• Scheduling of design projects with uncertain number of iterations
• Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine.
• Stochastic single machine scheduling with an exponentially distributed due date
• Scheduling jobs under simple linear deterioration

   Recommendations

• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties 👍 👎
• Single-machine scheduling subject to stochastic breakdowns 👍 👎
• Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties 👍 👎
• The single-machine absolute-deviation early-tardy problem with random completion times 👍 👎
• STOCHASTIC SCHEDULING WITH ASYMMETRIC EARLINESS AND TARDINESS PENALTIES UNDER RANDOM MACHINE BREAKDOWNS 👍 👎

This page was built for publication: Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs

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