The Coordination of Production and Delivery Problem with Available Constraint and Rejection

DOI

10.2991/msetasse-15.2015.273How to use a DOI?

Keywords

Scheduling, Unavailability interval, Rejection, Heuristic.

Abstract

In this paper we considered a scheduling problem including both production and job delivery, with machine availability and job rejection considerations. The objective is to minimize the arrival time of the last delivery batch of accepted jobs to the distribution center plus the total penalties of rejected jobs. Based on this NP-hard problem, we propose a heuristic with a worst-case error bound of 6, and the algorithm running time is O(nlogn).

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xie Xie
AU  - Xiangyu Kong
AU  - Yongyue Zheng
PY  - 2015/11
DA  - 2015/11
TI  - The Coordination of Production and Delivery Problem with Available Constraint and Rejection
BT  - Proceedings of the 2015 3rd International Conference on Management Science, Education Technology, Arts, Social Science and Economics
PB  - Atlantis Press
SP  - 1291
EP  - 1295
SN  - 2352-5398
UR  - https://doi.org/10.2991/msetasse-15.2015.273
DO  - 10.2991/msetasse-15.2015.273
ID  - Xie2015/11
ER  -