MINIMIZING MEAN FLOW TIME FOR THE TWO-MACHINE SCHEDULING PROBLEM WITH A SINGLE SERVER
The problem of scheduling jobs on two parallel machines to minimize the sum of completion times is considered. Each job requires a setup which is done by a single server. It is known that this problem is strongly NP-hard. Two mixed integer linear programming models and a simulated annealing algorith...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2016-10-01
|
| Series: | Informatika |
| Online Access: | https://inf.grid.by/jour/article/view/135 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849771597580206080 |
|---|---|
| author | F. Werner S. A. Kravchenko K. Hasani |
| author_facet | F. Werner S. A. Kravchenko K. Hasani |
| author_sort | F. Werner |
| collection | DOAJ |
| description | The problem of scheduling jobs on two parallel machines to minimize the sum of completion times is considered. Each job requires a setup which is done by a single server. It is known that this problem is strongly NP-hard. Two mixed integer linear programming models and a simulated annealing algorithm are proposed. The performance of these algorithms is evaluated for instances with up to 250 jobs. |
| format | Article |
| id | doaj-art-4ea4de51b9ed41299861f07d62df5141 |
| institution | DOAJ |
| issn | 1816-0301 |
| language | Russian |
| publishDate | 2016-10-01 |
| publisher | National Academy of Sciences of Belarus, the United Institute of Informatics Problems |
| record_format | Article |
| series | Informatika |
| spelling | doaj-art-4ea4de51b9ed41299861f07d62df51412025-08-20T03:02:34ZrusNational Academy of Sciences of Belarus, the United Institute of Informatics ProblemsInformatika1816-03012016-10-01011524134MINIMIZING MEAN FLOW TIME FOR THE TWO-MACHINE SCHEDULING PROBLEM WITH A SINGLE SERVERF. Werner0S. A. Kravchenko1K. Hasani2Университет Магдебурга, ГерманияОбъединенный институт проблем информатики НАН БеларусиИсламский университет Азад, ИранThe problem of scheduling jobs on two parallel machines to minimize the sum of completion times is considered. Each job requires a setup which is done by a single server. It is known that this problem is strongly NP-hard. Two mixed integer linear programming models and a simulated annealing algorithm are proposed. The performance of these algorithms is evaluated for instances with up to 250 jobs.https://inf.grid.by/jour/article/view/135 |
| spellingShingle | F. Werner S. A. Kravchenko K. Hasani MINIMIZING MEAN FLOW TIME FOR THE TWO-MACHINE SCHEDULING PROBLEM WITH A SINGLE SERVER Informatika |
| title | MINIMIZING MEAN FLOW TIME FOR THE TWO-MACHINE SCHEDULING PROBLEM WITH A SINGLE SERVER |
| title_full | MINIMIZING MEAN FLOW TIME FOR THE TWO-MACHINE SCHEDULING PROBLEM WITH A SINGLE SERVER |
| title_fullStr | MINIMIZING MEAN FLOW TIME FOR THE TWO-MACHINE SCHEDULING PROBLEM WITH A SINGLE SERVER |
| title_full_unstemmed | MINIMIZING MEAN FLOW TIME FOR THE TWO-MACHINE SCHEDULING PROBLEM WITH A SINGLE SERVER |
| title_short | MINIMIZING MEAN FLOW TIME FOR THE TWO-MACHINE SCHEDULING PROBLEM WITH A SINGLE SERVER |
| title_sort | minimizing mean flow time for the two machine scheduling problem with a single server |
| url | https://inf.grid.by/jour/article/view/135 |
| work_keys_str_mv | AT fwerner minimizingmeanflowtimeforthetwomachineschedulingproblemwithasingleserver AT sakravchenko minimizingmeanflowtimeforthetwomachineschedulingproblemwithasingleserver AT khasani minimizingmeanflowtimeforthetwomachineschedulingproblemwithasingleserver |