Integer programming approach to production scheduling for make-to-order manufacturing

AGH University of Science and Technology, Faculty of Management Department of Computer Integrated Manufacturing Al.Mickiewicza 30, 30-059 Krakow, Poland
Mathematical and Computer Modelling (Impact Factor: 1.42). 01/2005; DOI: 10.1016/j.mcm.2003.10.053
Source: DBLP

ABSTRACT This paper presents an integer programming approach to production scheduling in make-to-order environment with various due date related performance measures. The proposed formulations incorporate capacity constraints for a hybrid flowshop with multicapacity machines and with batch processing mode. Scheduling of divisible versus indivisible orders are considered. For the proposed integer programming formulations new cutting constraints are identified. Numerical examples modeled after real-world make-to-order assembly system are provided and some computational results with the proposed approach are reported.

  • [Show abstract] [Hide abstract]
    ABSTRACT: In make-to-order manufacturing environments, optimized production schedules are crucial. In this paper, we present a model for production scheduling in make-to-order environment with limited capacity and finite output buffers by using integer programming approach. In a system consist of several stages, various types of products are produced responding directly to customer orders which are characterized by their quantity, arrival date and due date. The orders completed before the due date will be held in an output buffer until they are delivered to the customer. The orders completed after the due date are considered late and a tardiness penalty incurs. The objective of the model is to maximize the profits by considering the limited capacity, order due dates, finite output buffers and related penalty cost. Numerical examples modeled after real-world make-to-order environment are provided and some computational results with the proposed model are reported.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In a one-of-a-kind production (OKP) company, the operation routing and processing time of an order are usually different from the others due to high customisation. As a result, an OKP company needs to dynamically adjust the production resources to keep the production lines reconfigurable. Through a proper assignment of operators in different sections of a production line, bottlenecks and operator re-allocation during production can be reduced effectively. In this paper, a mathematical model is introduced for optimal operator allocation planning on a reconfigurable production line in OKP. The optimisation objectives are to minimise the total number of the operators, total job earliness and tardiness, and the average work-in-process storage. A branch-and-bound algorithm with efficient pruning strategies is developed to solve this problem. The proposed model and the algorithm are empirically validated by using the data of a windows and doors manufacturing company. A software system based on the proposed approach has been implemented in the company.
    International Journal of Production Research 01/2011; 49(3):689-705. · 1.46 Impact Factor
  • Source
    Paper presented at the 5th World Conference on Mass Customization and Personalization MCPC 2009, Helsinki, Finland; 01/2009

Full-text (2 Sources)

Available from
May 17, 2014