Order acceptance and scheduling with batch delivery

We study an order acceptance and scheduling model with identical parallel machines and batch delivery.The objective is to optimize the tradeoff between maximum lead time and total cost.We propose two approximation algorithms for the model. We study an order acceptance and scheduling problem with batch delivery in a supply chain consisting of a manufacturer and a customer. The manufacturer can rejects some orders placed by the customer, and processes the others on parallel machines and then delivers them to the customer in batches. The objective is to minimize the weighted sum of the maximum lead time of the accepted orders and the total cost of rejecting and delivering orders. We develop two approximation algorithms for this NP-hard problem.

[1]  Dachuan Xu,et al.  Approximation algorithms for precedence-constrained identical machine scheduling with rejection , 2018, J. Comb. Optim..

[2]  Susan A. Slotnick,et al.  Order acceptance and scheduling: A taxonomy and review , 2011, Eur. J. Oper. Res..

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Zhi-Long Chen,et al.  Order Assignment and Scheduling in a Supply Chain , 2006, Oper. Res..

[5]  Stanislaw Gawiejnowicz,et al.  Time-Dependent Scheduling , 2008, Monographs in Theoretical Computer Science. An EATCS Series.

[6]  Jinjiang Yuan,et al.  Parallel-machine scheduling with deteriorating jobs and rejection , 2010, Theor. Comput. Sci..

[7]  T. C. Edwin Cheng,et al.  Order acceptance and scheduling on two identical parallel machines , 2015, J. Oper. Res. Soc..

[8]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[9]  Vitaly A. Strusevich,et al.  An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order , 2014, Comput. Ind. Eng..

[10]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[11]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.

[12]  Alessandro Agnetis,et al.  Scheduling with job-rejection and position-dependent processing times on proportionate flowshops , 2016, Optimization Letters.

[13]  Jinwen Ou,et al.  Order acceptance and scheduling with consideration of service level , 2016, Annals of Operations Research.

[14]  Gur Mosheiov,et al.  Scheduling on parallel identical machines with job-rejection and position-dependent processing times , 2012, Inf. Process. Lett..

[15]  Dvir Shabtay,et al.  A survey on offline scheduling with rejection , 2013, J. Sched..

[16]  Guoqing Wang,et al.  An improved heuristic for parallel machine scheduling with rejection , 2015, Eur. J. Oper. Res..

[17]  Dakui Jiang,et al.  Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines , 2016, Theor. Comput. Sci..

[18]  Jinjiang Yuan,et al.  Two-machine open-shop scheduling with rejection to minimize the makespan , 2016, OR Spectr..