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

DOI10.1016/S0895-7177(97)00074-5MaRDI QIDQ1368435zbMATH OpenFDO

Authors C. 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)

Recommendations

• Two scheduling problems of minimizing the maximum weighted completion time
• Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
• Single-machine scheduling with time window-dependent processing times
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines

Cites work

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

Cited in

(4)

• Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times
• An exact quantum annealing-driven branch and bound algorithm for maximizing the total weighted number of on-time jobs on a single machine
• A survey on scheduling problems with due windows
• Soft due window assignment and scheduling of unit-time jobs on parallel machines

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

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