4.3 Article

Scheduling with Variable Time Slot Costs

Journal

NAVAL RESEARCH LOGISTICS
Volume 57, Issue 2, Pages 159-171

Publisher

JOHN WILEY & SONS INC
DOI: 10.1002/nav.20393

Keywords

scheduling; time slot cost; NP-hardness; polynomial time algorithm

Funding

  1. NSF of China [70872079]
  2. Shanghai Pujiang Program [09PJC033]
  3. Hong Kong RGC General Research Fund [618807]

Ask authors/readers for more resources

In this article. we study a class of new scheduling models where time slot costs have to be taken into consideration. In Such models, processing a job will incur certain cost which is determined by the time slots occupied by the job in a schedule. The models apply when operational costs vary over time. The objective of the scheduling models is to minimize the total time slot costs plus a traditional scheduling performance measure. We consider the following performance measures: total completion time, maximum lateness/tardiness, total weighted number of tardy jobs, and total tardiness. We prove the intractability of the models under general parameters and provide polynomial-time algorithms for special cases with non-increasing time slot costs. (C) 2010 Wiley Periodicals. Inc. Naval Research Logistics 57: 159-171, 2010

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.3
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available