Scheduling Job Families on a Single Machine
The problem of scheduling n jobs on a single machine is considered, where the jobs are partitioned into several families and a set – up time is necessary between jobs of different families. The objective is to find a lower bound for the problem of minimizing the sum of completion times and the maxi...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Baghdad, College of Science for Women
2010-12-01
|
| Series: | مجلة بغداد للعلوم |
| Subjects: | |
| Online Access: | https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/11937 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849416846565965824 |
|---|---|
| author | Adawiyah A. Mahmood Naji M. Saheab |
| author_facet | Adawiyah A. Mahmood Naji M. Saheab |
| author_sort | Adawiyah A. Mahmood |
| collection | DOAJ |
| description |
The problem of scheduling n jobs on a single machine is considered, where the jobs are partitioned into several families and a set – up time is necessary between jobs of different families. The objective is to find a lower bound for the problem of minimizing the sum of completion times and the maximum tardiness. This paper uses a decomposition property to find a lower bound in order to incorporated in a branch and bound algorithm for constructing an optimal schedule.
|
| format | Article |
| id | doaj-art-5d44430b19df468a9890987e7abd6067 |
| institution | Kabale University |
| issn | 2078-8665 2411-7986 |
| language | English |
| publishDate | 2010-12-01 |
| publisher | University of Baghdad, College of Science for Women |
| record_format | Article |
| series | مجلة بغداد للعلوم |
| spelling | doaj-art-5d44430b19df468a9890987e7abd60672025-08-20T03:33:03ZengUniversity of Baghdad, College of Science for Womenمجلة بغداد للعلوم2078-86652411-79862010-12-017410.21123/bsj.2010.11937Scheduling Job Families on a Single MachineAdawiyah A. MahmoodNaji M. Saheab The problem of scheduling n jobs on a single machine is considered, where the jobs are partitioned into several families and a set – up time is necessary between jobs of different families. The objective is to find a lower bound for the problem of minimizing the sum of completion times and the maximum tardiness. This paper uses a decomposition property to find a lower bound in order to incorporated in a branch and bound algorithm for constructing an optimal schedule. https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/11937Scheduling, Set-up time, Multiple objective |
| spellingShingle | Adawiyah A. Mahmood Naji M. Saheab Scheduling Job Families on a Single Machine مجلة بغداد للعلوم Scheduling, Set-up time, Multiple objective |
| title | Scheduling Job Families on a Single Machine |
| title_full | Scheduling Job Families on a Single Machine |
| title_fullStr | Scheduling Job Families on a Single Machine |
| title_full_unstemmed | Scheduling Job Families on a Single Machine |
| title_short | Scheduling Job Families on a Single Machine |
| title_sort | scheduling job families on a single machine |
| topic | Scheduling, Set-up time, Multiple objective |
| url | https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/11937 |
| work_keys_str_mv | AT adawiyahamahmood schedulingjobfamiliesonasinglemachine AT najimsaheab schedulingjobfamiliesonasinglemachine |