Coke production scheduling problem: A parallel machine scheduling with batch preprocessings and location-dependent processing times

Liu, Ming; He, Junkai; Yang, Dapeng; Chu, Chengbin

doi:10.1016/j.cor.2018.12.002

Cited by 16 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the example in Table 1, a solution is scheduling string [8,2,6,4,11,1,10,9,5,12,7,3] and machine as-signment string…”

Section: Initialization and Formation Of Four Empiresmentioning

confidence: 99%

See 1 more Smart Citation

A Cooperated Imperialist Competitive Algorithm for Unrelated Parallel Batch Machine Scheduling Problem

Lei,

2024

CMC

View full text Add to dashboard Cite

This study focuses on the scheduling problem of unrelated parallel batch processing machines (BPM) with release times, a scenario derived from the moulding process in a foundry. In this process, a batch is initially formed, placed in a sandbox, and then the sandbox is positioned on a BPM for moulding. The complexity of the scheduling problem increases due to the consideration of BPM capacity and sandbox volume. To minimize the makespan, a new cooperated imperialist competitive algorithm (CICA) is introduced. In CICA, the number of empires is not a parameter, and four empires are maintained throughout the search process. Two types of assimilations are achieved: The strongest and weakest empires cooperate in their assimilation, while the remaining two empires, having a close normalization total cost, combine in their assimilation. A new form of imperialist competition is proposed to prevent insufficient competition, and the unique features of the problem are effectively utilized. Computational experiments are conducted across several instances, and a significant amount of experimental results show that the new strategies of CICA are effective, indicating promising advantages for the considered BPM scheduling problems.

show abstract

“…For the example in Table 1, a solution is scheduling string [8,2,6,4,11,1,10,9,5,12,7,3] and machine as-signment string…”

Section: Initialization and Formation Of Four Empiresmentioning

confidence: 99%

“…Jia et al [10] proposed a fuzzy ant colony optimization (ACO) for the problem with fuzzy processing time. Liu et al [11] designed a GA and a fast heuristic for the problem in coke production. Jia et al [12] applied two heuristics and an ACO for the problem with arbitrary capacities.…”

Section: Introductionmentioning

confidence: 99%

A Cooperated Imperialist Competitive Algorithm for Unrelated Parallel Batch Machine Scheduling Problem

Lei,

2024

CMC

View full text Add to dashboard Cite

show abstract

“…As the actual production scheduling problem and single machine scheduling problem become increasingly complex, some scholars have studied the parallel machine scheduling problem thereupon accordingly. These parallel machine scheduling studies are modeled by minimizing a certain objective, including costs, completion time, delay time, waiting time, delayed processing times and so on [13]- [16]. Cheng et al [17] designed a variable neighborhood search operator during the process of solutions in view of the step degradation effect of parallel machines.…”

Section: Introductionmentioning

confidence: 99%

An Integrated Flow Shop Scheduling Problem of Preventive Maintenance and Degradation With an Improved NSGA-II Algorithm

2023

View full text Add to dashboard Cite

The main objective of this research is to establish and solve a scheduling model for the degraded flow shop taking completion time and average device idle time as optimization objectives. Therefore, considering the interaction among schedule, production, maintenance and degradation, a mathematical model with completion time as well as average device idle time is constructed. Based on the NSGA-II algorithm, a local search strategy is first proposed to obtain junction points and sparse points according to the non-dominated sorted results. Subsequently, the comparative experiments are conducted utilizing NSGA-II-ALS, NSGA-II, and PSO algorithms. The optimal solution sets and Pareto diagrams of the three algorithms are obtained. The Gantt charts of the optimal solutions are drawn. Eventually, the multi-objective evaluation indexes of each algorithm are calculated and compared. Using statistical experiments and analysis, it can be found that NSGA-II-ALS exhibit excellent performance compared with other algorithms. The scheduling model proposed in this paper is able to effectively coordinate and balance the relationship among production, equipment maintenance and degradation, thus improving the efficiency of manufacturing systems, saving production costs, and realizing the optimal utilization of resources.

show abstract

“…In the production scheduling applications, the problem formulations with variable processing times are also important, e.g. in [9], a coke production scheduling problem is considered, where jobs influence on the processing time of other jobs due to increased production unit temperature. The authors of [9] construct an integer programming model to minimize the makespan, propose several heuristics, including a genetic algorithm, and compare their performance.…”

Section: Introductionmentioning

confidence: 99%

Multi-Core Processor Scheduling with Respect to Data Bus Bandwidth

Eremeev¹,

Malakhov²,

Sakhno³

et al. 2020

Preprint

View full text Add to dashboard Cite

The paper considers the problem of scheduling software modules on a multi-core processor, taking into account the limited bandwidth of the data bus and the precedence constraints. Two problem formulations with different levels of problem-specific detail are suggested and both shown to be NP-hard. A mixed integer linear programming (MILP) model is proposed for the first problem formulation, and a greedy algorithm is developed for the second one. An experimental comparison of the results of the greedy algorithm and the MILP solutions found by CPLEX solver is carried out.

show abstract

Coke production scheduling problem: A parallel machine scheduling with batch preprocessings and location-dependent processing times

Cited by 16 publications

References 17 publications

A Cooperated Imperialist Competitive Algorithm for Unrelated Parallel Batch Machine Scheduling Problem

A Cooperated Imperialist Competitive Algorithm for Unrelated Parallel Batch Machine Scheduling Problem

An Integrated Flow Shop Scheduling Problem of Preventive Maintenance and Degradation With an Improved NSGA-II Algorithm

Multi-Core Processor Scheduling with Respect to Data Bus Bandwidth

Contact Info

Product

Resources

About