Single Machine with Two-agent Scheduling Problem
| dc.contributor.author | Li, Hongwei | |
| dc.contributor.examiningcommittee | Appadoo, Srimantoorao (Supply Chain Management) Thulasiraman, Parimala (Computer Science) | en_US |
| dc.contributor.supervisor | Gajpal, Yuvraj (Supply Chain Management) Bector, C.R. (Supply Chain Management) | en_US |
| dc.date.accessioned | 2017-09-27T15:16:50Z | |
| dc.date.available | 2017-09-27T15:16:50Z | |
| dc.date.issued | 2016 | en_US |
| dc.degree.discipline | Management | en_US |
| dc.degree.level | Master of Science (M.Sc.) | en_US |
| dc.description.abstract | Scheduling problems have been studied for many years for optimizing resource allocation as scheduling plays a critical role in many manufacturing and service industries. During last two decades, two-agent scheduling problems have been used in many systems, such as railroad allocation system, aircraft landing system and so on. This thesis considers various two-agent scheduling problems with a single machine, which is responsible for processing jobs from two agents. The research of single machine with two-agent scheduling models can be classified into two main categories: minimality model and feasibility model. The feasibility model based two-agent scheduling problems are studied in this thesis. In a feasibility model, the scheduling problem is objective to minimize the objective function of one agent while keeping the objective function of the other agent within a pre-specified level. In the present thesis, mathematical models, heuristics, and Ant Colony Optimization based meta-heuristics are proposed for solving the problems studied in this thesis. Furthermore, this thesis also provides a detailed and systemic survey (literature review) of the two-agent scheduling problem literature on models with a given due date. In the chapter of survey of two-agent scheduling problems with due date, the computational complexity and proposed algorithms for the due-date-related two-agent scheduling problems are list. The two-agent scheduling problems studied and proposed algorithms in this thesis are extremely useful for improving the productivity and efficiency of the manufacturing environment in a supply chain system. | en_US |
| dc.description.note | February 2018 | en_US |
| dc.identifier.citation | Gajpal, Y., & Li, H. (2016). Single machine scheduling with two agents for total completion time objectives☆. Lecture Notes in Management Science, 8, 107. | en_US |
| dc.identifier.uri | http://hdl.handle.net/1993/32650 | |
| dc.language.iso | eng | en_US |
| dc.publisher | Lecture Notes in Management Science | en_US |
| dc.rights | open access | en_US |
| dc.subject | Scheduling Problem | en_US |
| dc.subject | Two-agent | en_US |
| dc.subject | Algortihm | en_US |
| dc.subject | Completion Time | en_US |
| dc.subject | Due Date | en_US |
| dc.title | Single Machine with Two-agent Scheduling Problem | en_US |
| dc.type | master thesis | en_US |