Modelling and symmetry breaking in scheduling problems on batch processing machines
| Autor: | Renan Spencer Trindade, Felipe Martins Müller, Olinto César Bassi de Araújo, Marcia Fampa |
|---|---|
| Přispěvatelé: | Programa de Engenharia de Sistemas e Computação (PESC), Universidade Federal do Rio de Janeiro (UFRJ), Universidade Federal de Santa Maria (UFSM), Departamento de electronica e computação (UFSM), Universidade Federal de Santa Maria = Federal University of Santa Maria [Santa Maria, RS, Brazil] (UFSM) |
| Rok vydání: | 2018 |
| Předmět: |
Job scheduler
0209 industrial biotechnology 021103 operations research Job shop scheduling Computer science Strategy and Management 0211 other engineering and technologies Scheduling (production processes) [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO] 02 engineering and technology Parallel computing Management Science and Operations Research computer.software_genre Industrial and Manufacturing Engineering Semiconductor industry 020901 industrial engineering & automation [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] Batch processing [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC] Symmetry breaking Batch processing machine Integer programming computer ComputingMilieux_MISCELLANEOUS |
| Zdroj: | International Journal of Production Research International Journal of Production Research, Taylor & Francis, 2018, 56 (22), pp.7031-7048. ⟨10.1080/00207543.2018.1424371⟩ |
| ISSN: | 1366-588X 0020-7543 |
| Popis: | Problems of scheduling batch-processing machines to minimise the makespan are widely exploited in the literature, mainly motivated by real-world applications, such as burn-in tests in the semiconductor industry. These problems consist of grouping jobs in batches and scheduling them on machines. We consider problems where jobs have non-identical sizes and processing times, and the total size of each batch cannot exceed the machine capacity. The processing time of a batch is defined as the longest processing time among all jobs assigned to it. Jobs can also have non-identical release times, and in this case, a batch can only be processed when all jobs assigned to it are available. This paper discusses four different versions of batch scheduling problems, considering a single processing machine or parallel processing machines and considering jobs with or without release times. New mixed integer linear programming formulations are proposed as enhancements of formulations proposed in the literature, and symmet... |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
| Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |