Single machine common due window scheduling with controllable job processing times

Authors:
Guohua Wan
Affiliations:
College of Management, Shenzhen University, Shenzhe, China
Venue:
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Year:
2007

Citing 7
Cited 0

Optimal common due-data with limited completion time deviation

Computers and Operations Research
Sequencing with earliness and tardiness penalties: a review

Operations Research
A survey of results for sequencing problems with controllable processing times

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

Operations Research
Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date

Operations Research
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a nonpreemptive single machine common due window scheduling problem where the job processing times are controllable with linear costs and the due window is movable. The objective is to find a job sequence, a processing time for each job, and a position of the common due window to minimize the total cost of weighted earliness/tardiness and processing time compression. We discuss some properties of the optimal solutions and provide a polynomial time algorithm to solve the problem.