Scheduling Parallel Machines for the Customer Order Problem

Authors:
Jaehwan Yang;Marc E. Posner
Affiliations:
Department of Business Administration, University of Incheon, Nam-gu, Republic of Korea 402-749;The Ohio State University, Industrial Engineering, Columbus 43210
Venue:
Journal of Scheduling
Year:
2005

Citing 0
Cited 6

A note on the complexity of the concurrent open shop problem

Journal of Scheduling
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines

Information Processing Letters
A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property

Computers and Operations Research
Improving the delivery efficiency of the customer order scheduling problem in a job shop

Computers and Industrial Engineering
Solving two-machine assembly scheduling problems with inventory constraints

Computers and Industrial Engineering
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers scheduling problems where jobs are dispatched in batches. The objective is to minimize the sum of the completion times of the batches. While a machine can process only one job at a time, multiple machines can simultaneously process jobs in a batch. This simple environment has a variety of real world applications such as part kitting and customer order scheduling.A heuristic is presented for the parallel machine version of the problem. Also, a tight worst case bound on the relative error is found. For the case of two parallel machines, we examine two heuristics, which are based on simple scheduling rules. We find tight worst case bounds of 6/5 and 9/7 on the relative error and show that neither procedure is superior for all instances. Finally, we empirically evaluate these two heuristics. For large problems, the methods find solutions that are close to optimal.