A short term production planning and scheduling model

Optimization of delivery adherence based on capacity planning and bid pricing

“…The approaches were analyzed based on the number of considered machines, pre-emption, objective and pricing [3]. Only three of the papers took pricing into account in scheduling [5][6][7]. The other authors subsequently evaluate the planning based on the resulting production costs.…”

“…Furthermore, it is pointed out that price flexibility leads to better results than lead time flexibility if there is no inventory flexibility for the manufacturer. Pourbabai [6,7] regards a scheduling algorithm based on linear programming that supports the decision in order acceptance or rejection. The goal is to calculate the optimal size of production batches by splitting.…”

A real-time order acceptance and scheduling approach for permutation flow shop problems

“…Wang, Zhu, and Cheng (2015) studied a subcontracting price scheme for the static order acceptance and scheduling problem in a single machine environment. The multi-order static problem has also been studied in a multiple machines environment (Chen, Mestry, Damodaran, & Wang, 2009;Pourbabai, 1989;Roundy et al, 2005;Wang, Huang, Hu, & Cheng, 2015;Wang, Xie, & Cheng, 2013a, 2013b. Wang et al (2013a) developed a modified artificial bee colony algorithm for solving the order acceptance problem in two machine static multiple-order PFSPs.…”

“…Chen et al (2009) addressed static order arrival in a job shop environment by using a mixed integer programming approach for smaller problems, and a B&B algorithm with Lagrangian bounds and approximate branching features for larger problems. Pourbabai (1989) developed a model to identify potential orders, order splitting considering due dates, and job set up, and scheduled jobs using a dispatch rule based on order availability and due dates on a multiple machine environment where the machines are grouped into cells (group technology concept). Roundy et al (2005) considered a job shop environment, in which an order is accepted, if it can in any way be inserted into the current schedule.…”

An Improved Artificial Bee Colony Algorithm for Order Acceptance and Scheduling in Flow Shop with Hybrid Blocking

“…Experimental data is set as follows: the number of orders n =10，15，20，30, return of order evenly distribute within [200,2000] and is generated randomly, processing time of order in each node evenly distribute within [1,5] and is generated randomly, delivery time of order evenly distribute within [10,30] and is generated randomly, unit penalty coefficient of storage time and blocking time of node is 1, unit penalty coefficient of delayed completion time is 3. Assuming there are four stages for multi-node production environment.…”