A Batching Machine Model for Lot Scheduling on a Single Machine
A recently introduced lot scheduling problem is considered. It is to find a partition of jobs of n orders into lots and to sequence these lots on a single machine so that the total average completion time of the orders is minimized. A simple O(n log n) time algorithm is presented for this problem in...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2018-03-01
|
| Series: | Foundations of Computing and Decision Sciences |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/fcds-2018-0003 |
| _version_ | 1798039751879557120 |
|---|---|
| author | Kovalyov Mikhail Y. |
| author_facet | Kovalyov Mikhail Y. |
| author_sort | Kovalyov Mikhail Y. |
| collection | DOAJ |
| description | A recently introduced lot scheduling problem is considered. It is to find a partition of jobs of n orders into lots and to sequence these lots on a single machine so that the total average completion time of the orders is minimized. A simple O(n log n) time algorithm is presented for this problem in the literature, with a relatively sophisticated proof of its optimality. We show that modeling this problem as a classic batching machine problem makes its optimal solution obvious. |
| first_indexed | 2024-04-11T21:58:04Z |
| format | Article |
| id | doaj.art-ebccde66060e44e6b5ede16a2f1ccd7d |
| institution | Directory Open Access Journal |
| issn | 2300-3405 |
| language | English |
| last_indexed | 2024-04-11T21:58:04Z |
| publishDate | 2018-03-01 |
| publisher | Sciendo |
| record_format | Article |
| series | Foundations of Computing and Decision Sciences |
| spelling | doaj.art-ebccde66060e44e6b5ede16a2f1ccd7d2022-12-22T04:01:02ZengSciendoFoundations of Computing and Decision Sciences2300-34052018-03-01431374010.1515/fcds-2018-0003fcds-2018-0003A Batching Machine Model for Lot Scheduling on a Single MachineKovalyov Mikhail Y.0United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganova 6, 220012, Minsk, BelarusA recently introduced lot scheduling problem is considered. It is to find a partition of jobs of n orders into lots and to sequence these lots on a single machine so that the total average completion time of the orders is minimized. A simple O(n log n) time algorithm is presented for this problem in the literature, with a relatively sophisticated proof of its optimality. We show that modeling this problem as a classic batching machine problem makes its optimal solution obvious.https://doi.org/10.1515/fcds-2018-0003schedulinglot-sizingsingle machinebatching machinepolynomial time algorithm |
| spellingShingle | Kovalyov Mikhail Y. A Batching Machine Model for Lot Scheduling on a Single Machine Foundations of Computing and Decision Sciences scheduling lot-sizing single machine batching machine polynomial time algorithm |
| title | A Batching Machine Model for Lot Scheduling on a Single Machine |
| title_full | A Batching Machine Model for Lot Scheduling on a Single Machine |
| title_fullStr | A Batching Machine Model for Lot Scheduling on a Single Machine |
| title_full_unstemmed | A Batching Machine Model for Lot Scheduling on a Single Machine |
| title_short | A Batching Machine Model for Lot Scheduling on a Single Machine |
| title_sort | batching machine model for lot scheduling on a single machine |
| topic | scheduling lot-sizing single machine batching machine polynomial time algorithm |
| url | https://doi.org/10.1515/fcds-2018-0003 |
| work_keys_str_mv | AT kovalyovmikhaily abatchingmachinemodelforlotschedulingonasinglemachine AT kovalyovmikhaily batchingmachinemodelforlotschedulingonasinglemachine |