Maximizing the weighted number of on-time jobs in single machine scheduling with time windows

DOI10.1016/S0895-7177(97)00074-5zbMath0897.90128MaRDI QIDQ1368435

Christos P. Koulamas

Publication date: 28 September 1997

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

single machinetime windowsweighted number of one-time jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

A survey on scheduling problems with due windows ⋮ Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times ⋮ Soft due window assignment and scheduling of unit-time jobs on parallel machines

Cites Work

• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Sequencing with Earliness and Tardiness Penalties: A Review
• `` Strong NP-Completeness Results
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties

This page was built for publication: Maximizing the weighted number of on-time jobs in single machine scheduling with time windows