PRODUCTION SCHEDULING WITH SEQUENCE-DEPENDENT SETUPS AND JOB RELEASE TIMES
Fuente:
Redalyc
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Artículo científico |
| Langue: | en |
| Publié: |
Universidad Nacional de Colombia
2010
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1876483204477616128 |
|---|---|
| author | JAIRO R. MONTOYA-TORRES |
| author_facet | JAIRO R. MONTOYA-TORRES |
| contents | PRODUCTION SCHEDULING WITH SEQUENCE-DEPENDENT SETUPS AND JOB RELEASE TIMES JAIRO R. MONTOYA-TORRES MILTON SOTO-FERRARI FERNANDO GONZÁLEZ-SOLANO Ingeniería heuristic Scheduling randomness release dates sequencedependent setup times This paper studies a shortterm production scheduling problem inspired from reallife 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 sequencedependent machine setup times. Since this problem is known to be strongly NPhard 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 randomgenerateddata and show that the heuristic performs very well compared against the optimal solution and lower bounds, and requiring short computational time. 2010 artículo científico 0012-7353 https://www.redalyc.org/articulo.oa?id=49615099028 en http://www.redalyc.org/revista.oa?id=496 Dyna application/pdf Universidad Nacional de Colombia Dyna (Colombia) Num.163 Vol.77 |
| format | Artículo científico |
| id | redalyc_49615099028 |
| institution | Redalyc |
| language | en |
| publishDate | 2010 |
| publisher | Universidad Nacional de Colombia |
| spellingShingle | PRODUCTION SCHEDULING WITH SEQUENCE-DEPENDENT SETUPS AND JOB RELEASE TIMES JAIRO R. MONTOYA-TORRES Ingeniería heuristic Scheduling randomness release dates sequencedependent setup times PRODUCTION SCHEDULING WITH SEQUENCE-DEPENDENT SETUPS AND JOB RELEASE TIMES JAIRO R. MONTOYA-TORRES MILTON SOTO-FERRARI FERNANDO GONZÁLEZ-SOLANO Ingeniería heuristic Scheduling randomness release dates sequencedependent setup times This paper studies a shortterm production scheduling problem inspired from reallife 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 sequencedependent machine setup times. Since this problem is known to be strongly NPhard 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 randomgenerateddata and show that the heuristic performs very well compared against the optimal solution and lower bounds, and requiring short computational time. 2010 artículo científico 0012-7353 https://www.redalyc.org/articulo.oa?id=49615099028 en http://www.redalyc.org/revista.oa?id=496 Dyna application/pdf Universidad Nacional de Colombia Dyna (Colombia) Num.163 Vol.77 |
| title | PRODUCTION SCHEDULING WITH SEQUENCE-DEPENDENT SETUPS AND JOB RELEASE TIMES |
| topic | Ingeniería heuristic Scheduling randomness release dates sequencedependent setup times |
| url | https://www.redalyc.org/articulo.oa?id=49615099028 |