Single machine two-agent scheduling problems with tardiness objectives
| dc.contributor.author | Li, Jiaji | |
| dc.contributor.examiningcommittee | Hajmohammad, Sara (Supply Chain Management) Thulasiram, Ruppa (Computer Science) | en_US |
| dc.contributor.supervisor | Gajpal, Yuvraj (Supply Chain Management) Appadoo, Srimantoorao S. (Supply Chain Management) | en_US |
| dc.date.accessioned | 2018-10-17T17:39:27Z | |
| dc.date.available | 2018-10-17T17:39:27Z | |
| dc.date.issued | 2018-10-15 | en_US |
| dc.date.submitted | 2018-10-15T18:10:09Z | en |
| dc.degree.discipline | Management | en_US |
| dc.degree.level | Master of Science (M.Sc.) | en_US |
| dc.description.abstract | In the last decade, study on two-agent scheduling has attracted lots of attention from many researchers due to its challenging complexity level and broad application in different areas. In this thesis, three two-agent scheduling problems are considered in which scheduling criteria of both agents need to be satisfied simultaneously. The first problem is a single machine two-agent scheduling problem, with the objective to minimize the weighted number of tardy jobs from the first agent. Meanwhile, the upper bound of weighted number of tardy jobs from another agent could not be violated. The second and the third problems take order acceptance into account. In these two scheduling problems, some of the jobs could be rejected when the workload is limited. The objective of these two problems is to maximize the profits gained from the revenues of accepted jobs, while the scheduling criterion for the second agent (weighted number of tardy jobs) is bounded by a pre-determined value. A heuristic method and a meta-heuristic solution method based on Particle Swarm Optimization and Tabu Search are proposed to solve the problems. In addition, a dynamic programming based exact algorithm which could optimally solve the first problem is developed. Furthermore, a mathematical formulation of the third problem is also provided. The main objective of the thesis is to develop algorithms for solving three different two-agent scheduling problems as stated earlier. | en_US |
| dc.description.note | February 2019 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1993/33531 | |
| dc.language.iso | eng | en_US |
| dc.rights | open access | en_US |
| dc.subject | Two-agent, Single machine, Due date, Number of tardy jobs, Total tardiness | en_US |
| dc.title | Single machine two-agent scheduling problems with tardiness objectives | en_US |
| dc.type | master thesis | en_US |