Order scheduling in dedicated and flexible machine environments

Order scheduling models are relatively new in the field of scheduling. Consider a facility with m parallel machines that can process k different products (job types). Each machine can process a given subset of different product types. There are n orders from n different clients. Each order requests specific quantities of the various different products that can be produced concurrently on their given subsets of machines; it may have a release date, a weight and a due date. Preemptions may be allowed. An order can not be shipped until the processing of all the products for the order has been completed. Thus, the finish time of an order is the time when the last job of the order has been completed. Even though the idea is somewhat new that order scheduling measures the overall completion time of a set of jobs (i.e., an order requesting different product types) instead of the individual completion time of each product type for any given order, many applications require that decision-makers consider orders rather than the individual product types in orders. Research into order scheduling models is motivated by their various real-life applications in manufacturing systems, equipment maintenance, computing systems, and other industrial contexts, where the components of each order can be processed concurrently on the parallel machines. In this research, two cases of order scheduling models are studied, namely, the fully dedicated environment in which each machine can produce one and only one product type, and the fully flexible machine environment in which each machine can produce all product types. With different side constraints and objective functions, the two cases include a lot of problems that are of interest. Special interest is focused on the minimization of the total weighted completion time, the number of late orders, the maximum lateness, and so on. On the one hand, polynomial time algorithms are proposed for some problems. One the other hand, for problems that are NP-hard, complexity proofs are shown and heuristics with their worst-case performance and empirical analyses are also presented.

Name thesis:degree_name

Doctor of Philosophy in Computing Sciences - (Ph.D.)

Discipline thesis:degree_discipline

Computer Science

Year

2005

Author dc:creator

• Li, Haibing

Contributors dc:contributor

• Joseph Y-T. Leung
• Michael Pinedo
• Alexandros V. Gerbessiotis

• Order scheduling
• Approximation algorithms
• Optimization
• NP-Hard
• Heuristics
• Computer Sciences

Repository record dc:identifier

https://digitalcommons.njit.edu/dissertations/704

OAI identifier oai:identifier

oai:digitalcommons.njit.edu:dissertations-1759