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

Authors:
C. Koulamas
Affiliations:
Department of Decision Sciences and Information Systems Florida International University, Miami, FL 33199, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1997

Citing 2
Cited 3

Sequencing with earliness and tardiness penalties: a review

Operations Research
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications

Journal of the ACM (JACM)

A scheduling problem with one producer and the bargaining counterpart with two producers

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs

Information Sciences: an International Journal
Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times

Journal of Scheduling

Quantified Score

Hi-index	0.98

Visualization

Abstract

The problem of maximizing the weighted number of on-time jobs on a single machine with time windows (STW) is shown to be strongly NP-hard. An efficient heuristic is presented for STW. Computational experiments indicate that the performance of the heuristic is quite good.