Solving Two Production Scheduling Problems with Sequence-Dependent Set-up Times

This file is part of IDEAS, which uses RePEc data

Solving Two Production Scheduling Problems with Sequence-Dependent Set-up Times

Author Info

Joao António Noivo
Helena Ramalhinho-Lourenço ()

Abstract

In today’s competitive markets, the importance of good scheduling strategies in manufacturing companies lead to the need of developing efficient methods to solve complex scheduling problems. In this paper, we studied two production scheduling problems with sequence-dependent setups times. The setup times are one of the most common complications in scheduling problems, and are usually associated with cleaning operations and changing tools and shapes in machines. The first problem considered is a single-machine scheduling with release dates, sequence-dependent setup times and delivery times. The performance measure is the maximum lateness. The second problem is a job-shop scheduling problem with sequence-dependent setup times where the objective is to minimize the makespan. We present several priority dispatching rules for both problems, followed by a study of their performance. Finally, conclusions and directions of future research are presented.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

Publisher Info
Paper provided by Department of Economics and Business, Universitat Pompeu Fabra in its series Economics Working Papers with number 338.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: Dec 1998
Date of revision:
Handle: RePEc:upf:upfgen:338

Contact details of provider:
Web page: http://www.econ.upf.edu/

For technical questions regarding this item, or to correct its listing, contact: ().

Find related papers by JEL classification:
C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Optimization Techniques; Programming Models; Dynamic Analysis
M11 - Business Administration and Business Economics; Marketing; Accounting - - Business Administration - - - Production Management
L60 - Industrial Organization - - Industry Studies: Manufacturing - - - General

This paper has been announced in the following NEP Reports:

NEP-ALL-1999-03-08 (All new papers)

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

Taillard, E., 1993. "Benchmarks for basic scheduling problems," European Journal of Operational Research, Elsevier, vol. 64(2), pages 278-285, January. [Downloadable!] (restricted)
N.D. Gupta, Jatinder, 1988. "Single facility scheduling with multiple job classes," European Journal of Operational Research, Elsevier, vol. 33(1), pages 42-45, January. [Downloadable!] (restricted)
Carlier, Jacques, 1982. "The one-machine sequencing problem," European Journal of Operational Research, Elsevier, vol. 11(1), pages 42-47, September. [Downloadable!] (restricted)

Full references

Statistics
Access and download statistics

Did you know? IDEAS uses the data collected within the RePEc project, the largest online bibliographic database in Economics.

This page was last updated on 2009-11-27.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.