Customer order scheduling with job-based processing on a single-machine to minimize the total completion time
- 1 January 2021
- journal article
- research article
- Published by Growing Science in International Journal of Industrial Engineering Computations
- Vol. 12 (3), 273-292
- https://doi.org/10.5267/j.ijiec.2021.3.001
Abstract
This study considers a customer order scheduling (COS) problem in which each customer requests a variety of products (jobs) processed on a single flexible machine, such as the computer numerical control (CNC) machine. A sequence-independent setup for the machine is needed before processing each product. All products in a customer order are delivered to the customer when they are processed. The product ordered by a customer and completed as the last product in the order defines the customer order’s completion time. We aim to find the optimal schedule of the customer orders and the products to minimize the customer orders’ total completion time. We have studied this customer order scheduling problem with a job-based processing approach in which the same products from different customer orders form a product lot and are processed successively without being intermingled with other products. We have developed two mixed-integer linear programming models capable of solving the small and medium-sized problem instances optimally and a heuristic algorithm for large-sized problem instances. Our empirical study results show that our proposed tabu search algorithm provides optimal or near-optimal solutions in a very short time. We have also compared the job-based and order-based processing approaches for both setup and no-setup cases and observed that the job-based processing approach yields better results when jobs have setup times.Keywords
This publication has 9 references indexed in Scilit:
- Customer order scheduling with job-based processing on a single-machine to minimize the total completion timeInternational Journal of Industrial Engineering Computations, 2021
- SINGLE-MACHINE SCHEDULING OF THE INDIVISIBLE MULTI-OPERATION JOBSSouth African Journal of Industrial Engineering, 2019
- A note on a single-machine lot scheduling problem with indivisible ordersComputers & Operations Research, 2017
- The Role of Electronic Coupling in Linear Porphyrin Arrays Probed by Single-Molecule Fluorescence SpectroscopyChemistry – A European Journal, 2011
- Lot streaming for customer order scheduling problem in job shop environmentsInternational Journal of Computer Integrated Manufacturing, 2009
- Scheduling multioperation jobs on a single flexible machineThe International Journal of Advanced Manufacturing Technology, 2008
- Customer order scheduling problem: a comparative metaheuristics studyThe International Journal of Advanced Manufacturing Technology, 2007
- Customer order scheduling on a single machine with family setup times: Complexity and algorithmsApplied Mathematics and Computation, 2006
- Scheduling The Production Of Components At A Common FacilityIIE Transactions, 1988