A survey of the state-of-the-art of common due date assignment and scheduling research |
| |
| Institution: | 1. Institute of Engineering Cybernetics, National Academy of Sciences of Belarus, Surganova 6, 220012 Minsk, Belarus;2. SAGEP Project, INRIA-Lorraine, Ile du Saulcy, 57012 Metz, France;3. Université de Technologie de Troyes, Troyes, 12, rue Marie Curie 10010, France;1. School of Economics and Management, Nanjing University of Science and Technology, Nanjing 210094, People׳s Republic of China;2. Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;1. Departamento Ingeniería Industrial, Universidad de Chile, Santiago, Chile;2. Department of Mathematics, Technische Universität Berlin, Germany;1. School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, China;2. Hennan Key Laboratory of Financial Engineering, Zhengzhou 450001, China;1. Fisher College of Business, The Ohio State University, Columbus, OH 43210, United States;2. Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, United States;3. Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong |
| |
| Abstract: | We aim at providing a unified framework of the common due date assignment and scheduling problems in the deterministic case by surveying the literature concerning the models involving single machine and parallel machines. The problems with due date determination have received considerable attention in the last 15 years due to the introduction of new methods of inventory management such as just-in-time (JIT) concepts. The common due date model corresponds, for instance, to an assembly system in which the components of the product should be ready at the same time, or to a shop where several jobs constitute a single customer's order. In the problems under consideration, the objective is to find an optimal value of the common due date and the related optimal schedule in order to optimize a given criterion based on the due date and the completion times of jobs. The results on the algorithms and complexity of the common due date assignment and scheduling problems are summarized. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
