A Heuristic Algorithm for the Two-Machine Flowshop Group Scheduling Problem

This paper presents the two-machine flowshop group scheduling problem with the optimal objective of maximum lateness. A dominance rule within group and a dominance rule between groups are established. These dominance rules along with a previously established dominance rule are used to develop a heuristic algorithm. Experimental results are given and analyzed.

A review of intelligent optimization for group scheduling problems in cellular manufacturing

Given that group technology can reduce the changeover time of equipment,broaden the productivity,and enhance the flexibility of manufacturing,especially cellular manufacturing,group scheduling problems(GSPs)have elicited considerable attention in the academic and industry practical literature.There are two issues to be solved in GSPs:One is how to allocate groups into the production cells in view of major setup times between groups and the other is how to schedule jobs in each group.Although a number of studies on GSPs have been published,few integrated reviews have been conducted so far on considered problems with different constraints and their optimization methods.To this end,this study hopes to shorten the gap by reviewing the development of research and analyzing these problems.All literature is classified according to the number of objective functions,number of machines,and optimization algorithms.The classical mathematical models of single-machine,permutation,and distributed flowshop GSPs based on adjacent and position-based modeling methods,respectively,are also formulated.Last but not least,outlooks are given for outspread problems and problem algorithms for future research in the fields of group scheduling.

The Study of Group Scheduling Problems with General Dual-Position-Based Job Processing Times

Scheduling with group technology has been a vivid research area in the past decades.However,group technology with general dual-effect variable processing times needs to be further explored although this kind of group technology plays an important role in some actual manufacturing scenarios.Accordingly,this paper considers group scheduling problems with a kind of general group variable processing times model,where the actual processing time of each job in group is variable due to the dual effect of both the job position and the group position.The objectives of two types of considered problems are to minimize the makespan and the total completion time,respectively.Based on the decomposition analysis,the mathematical logic analysis and the computational complexity proof,it is obtained that the makespan minimization problem and the total completion time minimization problem are both polynomially solvable under the condition that the group number is constant.For three special cases of considered problems,polynomial solving algorithms with lower computational complexity are proposed.

TWO SCHEDULING PROBLEMS IN GROUP TECHNOLOGY WITH DETERIORATING JOBS

This paper considers single-machine scheduling problems in group technology with the jobs' processing times being simple linear functions of their start times.The objective functions are the ~minimizing of makespan and total weighted completion time.Some optimal conditions and algorithms are given and the fact that the problem of total weighted completion times is NP-hard is proved.