.png){kind=icon}
.png){kind=icon}
Return
Order acceptance and scheduling with machine availability constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2013.07.032.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider an order acceptance and scheduling model with machine availability constraints. The manufacturer (machine) is assumed to be available to process orders only within a number of discontinuous time intervals. To capture the real-life behavior of a typical manufacturer who has restrictions of time availability to process orders, our model allows the manufacturer to reject or outsource some of the orders. When an order is rejected or outsourced, an order-dependent cost of penalty will occur. The objective is to minimize the makespan of all accepted orders plus the total penalty of all rejected/outsourced orders. We study the approximability of the model and some of its important special cases. Crown Copyright (C) 2013 Published by Elsevier B.V. All rights reserved.
Keywords:
Order acceptance and scheduling
Machine availability constraints
Job rejection
Approximation
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W