Single machine interfering jobs problem with flowtime objective

González, Pérez

doi:10.1007/s10845-015-1141-6

Cited by 4 publications

(2 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In that case, the problem is similar to schedule a single machine. For such a scheduling problem, there are extensive studies [34][35][36][37][38][39][40]. Thus, to ensure the non-interruption requirement of machines at the second stage, it should satisfy α g < β when the system is designed.…”

Section: System Descriptionmentioning

confidence: 99%

A Two-Step Approach to Scheduling a Class of Two-Stage Flow Shops in Automotive Glass Manufacturing

Qiao

et al. 2023

Machines

View full text Add to dashboard Cite

Driven from real-life applications, this work aims to cope with the scheduling problem of automotive glass manufacturing systems, that is characterized as a two-stage flow-shop with small batches, inevitable setup time for different product changeover at the first stage, and un-interruption requirement at the second stage. To the best knowledge of the authors, there is no report on this topic from other research groups. Our previous study presents a method to assign all batches to each machine at the first stage only without sequencing the assigned batches, resulting in an incomplete schedule. To cope with this problem, if a mathematical programming method is directly applied to minimize the makespan of the production process, binary variables should be introduced to describe the processing sequence of all the products, not only the batches, resulting in huge number of binary variables for the model. Thus, it is necessary and challenging to search for a method to solve the problem efficiently. Due to the mandatory requirement that the second stage should keep working continuously without interruption, solution feasibility is essential. Therefore, the key to solve the addressed problem is how to guarantee the solution feasibility. To do so, we present a method to determine the minimal size of each batch such that the second stage can continuously work without interruption if the sizes of all batches are same. Then, the conditions under which a feasible schedule exists are derived. Based on the conditions, we are able to develop a two-step solution method. At the first step, an integer linear program (ILP) is formulated for handling the batch allocation problem at the first stage. By the ILP, we need then to distinguish the batches only, greatly reducing the number of variables and constraints. Then, the batches assigned to each machine at the first stage are optimally sequenced at the second step by an algorithm with polynomial complexity. In this way, by the proposed method, the computational complexity is greatly reduced in comparison with the problem formulation without the established feasibility conditions. To validate the proposed approach, we carry out extensive experiments on a real case from an automotive glass manufacturer. We run ILP on CPLEX for testing. For large-size problems, we set 3600 s as the longest time for getting a solution and a gap of 1% for the lower bound of solutions. The results show that CPLEX can solve 96.83% cases. Moreover, we can obtain good solutions with the maximum gap of 4.9416% for the unsolved cases.

show abstract

Section: System Descriptionmentioning

confidence: 99%

A Two-Step Approach to Scheduling a Class of Two-Stage Flow Shops in Automotive Glass Manufacturing

Qiao

et al. 2023

Machines

View full text Add to dashboard Cite

show abstract

“…Scheduling problem is a classic research problem [ 1 – 3 ] to improve production efficiency and reduce cost in production workshop. Parallel flow shop [ 4 – 7 ] refers to a production mode in which a plurality of production lines are arranged in the form of flow shop, which generally exists in cable, household appliances, automobile manufacturing, steel and other industries [ 8 – 10 ]. Röck [ 11 ] has proved that the flow shop scheduling problem with more than three machines is NP-complete.…”

Section: Introductionmentioning

confidence: 99%

Research on multi-objective optimal scheduling considering the balance of labor workload distribution

Liu

Ling

et al. 2021

PLoS ONE

View full text Add to dashboard Cite

In order to solve the problem of unbalanced workload of employees in parallel flow shop scheduling, a method of job standard balance is proposed to describe the work balance of employees. The minimum delay time of completion and the imbalance of employee work are taken as the two goals of the model. A bi-objective nonlinear integer programming model is proposed. NSGA-II-EDSP, NSGA-II-KES, and NSGA-II-QKES heuristic rule algorithms are designed to solve the problem. A number of computational experiments of different sizes are conducted, and compared with solutions generated by NSGA-II. The experimental results show the advantages of the proposed model and method, which error is reduced 14.56%, 15.16% and 15.67%.

show abstract

Adaptive genetic algorithm for two-stage hybrid flow-shop scheduling with sequence-independent setup time and no-interruption requirement

Qiao

et al. 2022

Expert Systems with Applications

View full text Add to dashboard Cite

Single machine interfering jobs problem with flowtime objective

Cited by 4 publications

References 45 publications

A Two-Step Approach to Scheduling a Class of Two-Stage Flow Shops in Automotive Glass Manufacturing

A Two-Step Approach to Scheduling a Class of Two-Stage Flow Shops in Automotive Glass Manufacturing

Research on multi-objective optimal scheduling considering the balance of labor workload distribution

Adaptive genetic algorithm for two-stage hybrid flow-shop scheduling with sequence-independent setup time and no-interruption requirement

Contact Info

Product

Resources

About