Minimizing weighted number of early and tardy jobs with a common due window involving location penalty

DOI10.1023/A:1016094508744zbMath0993.90044OpenAlexW117973949MaRDI QIDQ1610881

Yeung, W. K., Cheng, T. C. Edwin, Oguz, Ceyda

Publication date: 20 August 2002

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

Full work available at URL: https://doi.org/10.1023/a:1016094508744

zbMATH Keywords

dynamic programmingdue windowNP-completenesssingle machine schedulingearly-tardy job

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (12)

Due-window assignment scheduling in the proportionate flow shop setting ⋮ A survey on scheduling problems with due windows ⋮ SINGLE MACHINE SCHEDULING WITH A LEARNING EFFECT AND A RATE-MODIFYING ACTIVITY ⋮ Due-window assignment scheduling problems with position-dependent weights on a single machine ⋮ Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times ⋮ COMMON DUE-WINDOW ASSIGNMENT AND SCHEDULING OF JOB-DEPENDENT DETERIORATING JOBS AND MULTIPLE DETERIORATING MAINTENANCE ACTIVITIES ⋮ Bicriterion scheduling with a negotiable common due window and resource-dependent processing times ⋮ An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time ⋮ Scheduling problems with a common due window assignment: A survey

This page was built for publication: Minimizing weighted number of early and tardy jobs with a common due window involving location penalty