Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed

This paper considers two single-machine scheduling problems with outsourcing allowed where each job can be either processed on an in-house single-machine or outsourced. They include the problem of minimizing maximum lateness and outsourcing costs, and that of minimizing total tardiness and outsourci...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 186; no. 3; pp. 931 - 952
Main Authors Lee, Ik Sun, Sung, C.S.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.05.2008
Elsevier
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Algorithms
Applied sciences
Branch & bound algorithms
Due-date related measures
Exact sciences and technology
Heuristic
Inventory control, production control. Distribution
Job shops
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Outsourcing
Outsourcing strategy
Production scheduling
Scheduling, sequencing
Single-machine scheduling
Studies
Single-machine scheduling
Due-date related measures
Outsourcing strategy
Productivity
Branch and bound method
Paper machine
Scheduling
Subcontracting
Motor industry
Due date
Delay
Electronics industry
Heuristic method
NP hard problem
Lateness
Budget
Outsourcing
Single machine
Online AccessGet full text

Cover

More Information
Summary:This paper considers two single-machine scheduling problems with outsourcing allowed where each job can be either processed on an in-house single-machine or outsourced. They include the problem of minimizing maximum lateness and outsourcing costs, and that of minimizing total tardiness and outsourcing costs. Outsourcing is commonly required as a way to improve productivity in various companies including electronics industries and motor industries. The objective is to minimize the weighted sum of the outsourcing cost and the scheduling measure represented by either one of maximum lateness and total tardiness, subject to outsourcing budget. It is proved that the problem is NP-hard. Some solution properties are characterized to derive heuristic algorithms, and also a branch-and-bound algorithm. Numerical experiments are conducted to evaluate performance of the derived algorithms.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2007.02.015