A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times

Authors:
Bibo Yang;Joseph Geunes
Affiliations:
Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA;Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA
Venue:
Computers and Industrial Engineering
Year:
2007

Citing 12
Cited 3

A survey of results for sequencing problems with controllable processing times

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Annals of Operations Research
On the competitiveness of on-line real-time task scheduling

Real-Time Systems
Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems

SIAM Journal on Computing
A fast taboo search algorithm for the job shop problem

Management Science
Online interval scheduling

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
Multiprocessor Scheduling with Rejection

SIAM Journal on Discrete Mathematics
Approximating the Throughput of Multiple Machines in Real-Time Scheduling

SIAM Journal on Computing
The Dynamic and Stochastic Knapsack Problem with Random Sized Items

Operations Research
A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling

Computers and Operations Research
On-line scheduling of unit time jobs with rejection: minimizing the total completion time

Operations Research Letters

Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment

Computers and Operations Research
A tabu search algorithm for order acceptance and scheduling

Computers and Operations Research
A survey on offline scheduling with rejection

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider single-resource scheduling when candidate jobs may be accepted (producing job-specific profit) or rejected. Our solution approaches seek to maximize the profitability of the resulting schedule under job-specific tardiness costs and reducible processing times (at a cost). We present an algorithm that maximizes schedule profit for a given sequence of jobs, along with two heuristic approaches for generating good job sequences. A set of computational tests on randomly generated problem instances demonstrates the relative effectiveness of our proposed heuristic approaches.