Sequencing jobs for an automated manufacturing module with buffer |
| |
| Affiliation: | 1. University of Brescia, Department of Economics and Management, Brescia, Italy;2. ESSEC Business School in Paris, Department of Information Systems, Decision Sciences and Statistics, Paris, France;3. Politecnico di Milano, Department of Electronics, Information and Bioengineering, Milan, Italy;4. Multiprotexion srl, Gropello Cairoli, Italy;1. Department of Electrical and Computer Engineering, Michigan State University, East Lansing, MI 48824, USA;2. Principal Research & Development Engineer, Maptek Pty Ltd, Level 2, 190 Aberdeen Street, Northbridge, WA 6003, Australia;1. Department of Industrial Engineering, Bilkent University, Ankara, Turkey;2. Department of Integrated Systems Engineering, The Ohio State University, Columbus, OH, USA |
| |
| Abstract: | This article deals with the real-time scheduling of jobs for an automated manufacturing module offering a variety of operations with negligible setup times. Since the jobs are brought to the system by a paced line at a fixed rate, each job is expected to be processed within a fixed cycle time. Hence, a group of jobs with longer processing-time may cause immediate accumulation of jobs in the limited input buffer. Consequently, an arriving job may be blocked from entering until the job in the station is completed. A Dynamic Program is implemented to schedule the jobs with the minimum total blocking time. Depending on the data, this implementation may become computationaly intractable, and thereby, a heuristic is developed to produce good solutions in polynomial time. The worst case error bounds are established for the heuristic solutions. An extensive experimentation shows that the heuristic yields close to optimal solutions effectively. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
