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

DOI10.1287/opre.45.1.66zbMath0892.90100OpenAlexW2146665054MaRDI QIDQ4367265

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)

Related Items (6)

Scheduling jobs under simple linear deterioration ⋮ Scheduling of design projects with uncertain number of iterations ⋮ Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties ⋮ 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 ⋮ Single-machine common due date total earliness/tardiness scheduling with machine unavailability

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