期刊文献+
共找到7篇文章
< 1 >
每页显示 20 50 100
A Cooperated Imperialist Competitive Algorithm for Unrelated Parallel Batch Machine Scheduling Problem
1
作者 Deming Lei Heen Li 《Computers, Materials & Continua》 SCIE EI 2024年第5期1855-1874,共20页
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... 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 formoulding.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 aremaintained 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 newstrategies of CICAare effective,indicating promising advantages for the considered BPMscheduling problems. 展开更多
关键词 Release time ASSIMILATION imperialist competitive algorithm batch processing machines scheduling
下载PDF
Competitive Project Scheduling on Two Unbounded Parallel Batch Machines
2
作者 Ling-Fa Lu Li-Qi Zhang 《Journal of the Operations Research Society of China》 EI CSCD 2018年第3期349-389,共41页
This paper considers competitive project scheduling on two unbounded parallel batch machines.There are two competing firms,and each firm has an unbounded parallel batch machine.All projects must be performed in batche... This paper considers competitive project scheduling on two unbounded parallel batch machines.There are two competing firms,and each firm has an unbounded parallel batch machine.All projects must be performed in batches by Firms 1 and 2 on their machines,respectively.The profit that each firm obtains from each project depends on whether the firm finishes the job before or after its competitor.In the first problem,given a feasible schedule for Firm 1,the objective is to find an optimal schedule to maximize the total reward for Firm 2 under the given schedule for Firm 1.The corresponding total reward for Firm 1 is called the worst-case total reward of the given schedule for Firm 1.In the second problem,the objective is to find an optimal schedule for Firm 1 to maximize the worst-case total reward.We provide optimal algorithms for the two problems,respectively. 展开更多
关键词 Project scheduling COMPETITION Parallel batch machine
原文传递
Minimizing Maximum Lateness on Unbounded Single Batching Machine with Family Jobs
3
作者 郑睿 李宏余 《Journal of Donghua University(English Edition)》 EI CAS 2010年第5期639-642,共4页
The scheduling problem on a single batching machine with family jobs was proposed.The single batching machine can process a group of jobs simultaneously as a batch.Jobs in the same batch complete at the same time.The ... The scheduling problem on a single batching machine with family jobs was proposed.The single batching machine can process a group of jobs simultaneously as a batch.Jobs in the same batch complete at the same time.The batch size is assumed to be unbounded.Jobs that belong to different families can not be processed in the same batch.The objective function is minimizing maximum lateness.For the problem with fixed number of m families and n jobs,a polynomial time algorithm based on dynamic programming with time complexity of O(n(n/m+1)m)was presented. 展开更多
关键词 SCHEDULING batching machine family jobs maximum lateness dynamic programming
下载PDF
A Multi-Objective Hybrid Algorithm for the Casting Scheduling Problem with Unrelated Batch Processing Machine
4
作者 Wei Zhang Hongtao Tang +3 位作者 Wenyi Wang Mengzhen Zhuang Deming Lei Xi Vincent Wang 《Complex System Modeling and Simulation》 EI 2024年第3期236-257,共22页
The casting production process typically involves single jobs and small batches,with multiple constraints in the molding and smelting operations.To address the discrete optimization challenge of casting production sch... The casting production process typically involves single jobs and small batches,with multiple constraints in the molding and smelting operations.To address the discrete optimization challenge of casting production scheduling,this paper presents a multi-objective batch scheduling model for molding and smelting operations on unrelated batch processing machines with incompatible job families and non-identical job sizes.The model aims to minimise the makespan,number of batches,and average vacancy rate of sandboxes.Based on the genetic algorithm,virus optimization algorithm,and two local search strategies,a hybrid algorithm(GA-VOA-BMS)has been designed to solve the model.The GA-VOA-BMS applies a novel Batch First Fit(BFF)heuristic for incompatible job families to improve the quality of the initial population,adopting the batch moving strategy and batch merging strategy to further enhance the quality of the solution and accelerate the convergence of the algorithm.The proposed algorithm was then compared with multi-objective swarm optimization algorithms,namely NSGA-ll,SPEA-l,and PESA-ll,to evaluate its effectiveness.The results of the performance comparison indicate that the proposed algorithm outperforms the others in terms of both qualityand stability. 展开更多
关键词 multi-objective optimization unrelated batch Processing machines(BPMs) casting scheduling virus optimizationalgorithm
原文传递
Flow-Shop Scheduling with Transportation Capacity and Time Consideration 被引量:2
5
作者 Chia-Nan Wang Glen Andrew Porter +2 位作者 Ching-Chien Huang Viet Tinh Nguyen Syed Tam Husain 《Computers, Materials & Continua》 SCIE EI 2022年第2期3031-3048,共18页
Planning and scheduling is one of the most important activity in supply chain operation management.Over the years,there have been multiple researches regarding planning and scheduling which are applied to improve a va... Planning and scheduling is one of the most important activity in supply chain operation management.Over the years,there have been multiple researches regarding planning and scheduling which are applied to improve a variety of supply chains.This includes two commonly used methods which are mathematical programming models and heuristics algorithms.Flowshop manufacturing systems are seen normally in industrial environments but few have considered certain constraints such as transportation capacity and transportation time within their supply chain.A two-stage flowshop of a single processing machine and a batch processing machine are considered with their capacity and transportation time between twomachines.The objectives of this research are to build a suitable mathematical model capable of minimizing the maximum completion time,to propose a heuristic optimization algorithm to solve the problem,and to develop an applicable program of the heuristics algorithm.AMixed Integer Programming(MIP)model and a heuristics optimization algorithmwas developed and tested using a randomly generated data set for feasibility.The overall results and performance of each approach was compared between the two methods that would assist the decision maker in choosing a suitable solution for their manufacturing line. 展开更多
关键词 Scheduling two-stage flowshop supply chain management TRANSPORTATION batch processing machine HEURISTIC
下载PDF
Two-stage scheduling on batch and single machines with limited waiting time constraint
6
作者 Zhongshun SHI Zewen HUANG Leyuan SHI 《Frontiers of Engineering Management》 2017年第3期368-374,共7页
This study addresses the problem of two-stage scheduling on batch and single machines with limited waiting time constraint; thus, the makespan is minimized.A mixed-integer linear programming model is proposed for this... This study addresses the problem of two-stage scheduling on batch and single machines with limited waiting time constraint; thus, the makespan is minimized.A mixed-integer linear programming model is proposed for this problem. Three tight lower bounds and a heuristic algorithm are developed. The worst-case performance of the proposed algorithm is discussed. A hybrid differential evolution algorithm is also developed to improve the solution quantity. Numerical results show that the hybrid algorithm is capable of obtaining high-quality solutions and exhibits a competitive 展开更多
关键词 batch machine flow shop MAKESPAN limited waiting time
原文传递
APPROXIMATION SCHEMES FOR SCHEDULING A BATCHING MACHINE WITH NONIDENTICAL JOB SIZE 被引量:2
7
作者 Xianzhao ZHANG Yuzhong ZHANG +1 位作者 Zhigang CAO Zengxia CAI 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2007年第4期592-600,共9页
In this paper we study the problem of scheduling a batching machine with nonidentical job sizes. The jobs arrive simultaneously and have unit processing time. The goal is to minimize the total completion times. Having... In this paper we study the problem of scheduling a batching machine with nonidentical job sizes. The jobs arrive simultaneously and have unit processing time. The goal is to minimize the total completion times. Having shown that the problem is NP-hard, we put forward three approximation schemes with worst case ratio 4, 2, and 3/2, respectively. 展开更多
关键词 Approximation scheme batching machine SIZE worst case ratio.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部