A preemptive scheduling and due date assignment for single-machine in batch delivery system
Neelam Tyagi, Mehdi Abedi, Ram Gopal Varshney
Available Online April 2013.
- In this paper we have proposed a new linear mathematical model for due date assignment on the single machine scheduling problem in a batch delivery system. Some assumptions are used as due dates are controllable, dynamic job arrivals; unforced machine idle and preemption are allowed. In this paper we propose a novel method of finding the sequence of jobs, batching of jobs for delivery and due date assignment of the jobs, so as to minimize the total of earliness, tardiness, holding, due date assignment, setup and delivery costs in just-in-time environment. Due to complexity of the problem it is NP hard too.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Neelam Tyagi AU - Mehdi Abedi AU - Ram Gopal Varshney PY - 2013/04 DA - 2013/04 TI - A preemptive scheduling and due date assignment for single-machine in batch delivery system BT - Proceedings of the Conference on Advances in Communication and Control Systems-2013 PB - Atlantis Press SP - 60 EP - 64 SN - 1951-6851 UR - https://www.atlantis-press.com/article/6278 ID - Tyagi2013/04 ER -