A survey of scheduling problems with setup times or costs

Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

A linear programming-based method for job shop scheduling

We present a decomposition heuristic for a large class of job shop scheduling problems. This heuristic utilizes information from the linear programming formulation of the associated optimal timing problem to solve subproblems, can be used for any objective function whose associated optimal timing problem can be expressed as a linear program (LP), and is particularly effective for objectives that include a component that is a function of individual operation completion times. Using the proposed heuristic framework, we address job shop scheduling problems with a variety of objectives where intermediate holding costs need to be explicitly considered. In computational testing, we demonstrate the performance of our proposed solution approach

Single machine scheduling with release dates and job delivery to minimize the makespan

AbstractIn single machine scheduling with release dates and job delivery, jobs are processed on a single machine and then delivered by a capacitated vehicle to a single customer. Only one vehicle is employed to deliver these jobs. The vehicle can deliver at most c jobs at a shipment. The delivery completion time of a job is defined as the time at which the delivery batch containing the job is delivered to the customer and the vehicle returns to the machine. The objective is to minimize the makespan, i.e., the maximum delivery completion time of the jobs. When preemption is allowed to all jobs, we give a polynomial-time algorithm for this problem. When preemption is not allowed, we show that this problem is strongly NP-hard for each fixed c≥1. We also provide a 53-approximation algorithm for this problem, and the bound is tight

Heuristics for the Early/Tardy Scheduling Problem with Release Dates

In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no unforced idle time. We analyse the performance of several dispatch rules, a greedy procedure and a decision theory local search heuristic. The dispatch rules use a lookahead parameter whose value must be specified. We perform some experiments to determine an appropriate value for this parameter. The use of dominance rules to improve the solutions obtained by these heuristics is also considered. The computational results show that the use of the dominance rules can indeed improve the solution quality with little additional computational e?ort. To the best of our knowledge, this is the first analysis of heuristic performance for the early/tardy scheduling problem with release dates and no unforced idle time.scheduling, early/tardy, release dates, heuristics