Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Cited by Google
- Similars in SciELO
- Similars in Google
Share
DYNA
Print version ISSN 0012-7353On-line version ISSN 2346-2183
Abstract
MONTOYA-TORRES, JAIRO R.; SOTO-FERRARI, MILTON and GONZALEZ-SOLANO, FERNANDO. PRODUCTION SCHEDULING WITH SEQUENCE-DEPENDENT SETUPS AND JOB RELEASE TIMES. Dyna rev.fac.nac.minas [online]. 2010, vol.77, n.163, pp.260-269. ISSN 0012-7353.
This paper studies a short-term production scheduling problem inspired from real-life manufacturing systems consisting on the scheduling a set of jobs (production orders) on both a single machine and identical parallel machines with the objective of minimizing the makespan or maximum completion time of all jobs. Jobs are subject to release dates and there are sequence-dependent machine setup times. Since this problem is known to be strongly NP-hard even for the single machine case, this paper proposes a heuristic algorithm to solve it. The algorithm uses a strategy of random generation of various execution sequences, and then selects the best of such schedules. Experiments are performed using random-generated data and show that the heuristic performs very well compared against the optimal solution and lower bounds, and requiring short computational time.
Keywords : Scheduling; sequence-dependent setup times; release dates; randomness; heuristic.