✦ LIBER ✦

Scheduling grouped jobs on single machine with genetic algorithm

✍ Scribed by Dingwei Wang; Mitsuo Gen; Runwwei Cheng

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 176 KB
Volume: 36
Category: Article
ISSN: 0360-8352
DOI: 10.1016/s0360-8352(99)00134-5

No coin nor oath required. For personal study only.

✦ Synopsis

Production scheduling of grouped jobs has been an active research area since GT (Group Technology) was widely applied in practical manufacturing systems. To minimize the total ¯owtime of grouped jobs on a single machine, we combine jobs into fundamental runs based upon the necessary condition of the optimal solution. It is proved that the optimal solution is a combination of fundamental runs. A genetic algorithm is designed based on studies on the combinatorial rules of fundamental runs. The numerical results show that the computational performance of the algorithm depends on the number of `fundamental' runs, not on the number of jobs. In general, the number of fundamental runs is far less than the number of jobs. Therefore, the algorithm has potential for practical application in large scale production systems.

📜 SIMILAR VOLUMES

A modified genetic algorithm for single

A modified genetic algorithm for single machine scheduling

✍ Jiyin Liu; Lixin Tang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 301 KB

In this paper we propose a modified genetic algorithm for the single machine scheduling problem with ready times. This algorithm improves the simple genetic algorithm by introducing two new steps: (1) a filtering step to filter out the worst solutions in each generation and fill in their positions w

Considerations of single-machine schedul

Considerations of single-machine scheduling with deteriorating jobs

✍ Chuan-Li Zhao; Chou-Jung Hsu; Dar-Li Yang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 220 KB

Single-machine scheduling jobs with expo

Single-machine scheduling jobs with exponential learning functions

✍ Ji-Bo Wang; Jian-Jun Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 195 KB

In a manufacturing system workers are involved in doing the same job or activity repeatedly. Hence, the workers start learning more about the job or activity. Because of the learning, the time to complete the job or activity starts decreasing, which is known as ''learning effect''. In this paper, an

A computerized algorithm for scheduling

A computerized algorithm for scheduling dependent jobs with weights in a single machine

✍ R. Meenakshi Sundaram; Wen-shiom Lian 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 337 KB

Single-machine group scheduling with bot

Single-machine group scheduling with both learning effects and deteriorating jobs

✍ Xue Huang; Ming-Zheng Wang; Ji-Bo Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 205 KB

In the paper two resource constrained single-machine group scheduling problems with both learning effects and deteriorating jobs are considered. By learning effects, deteriorating jobs and group technology assumption, we mean that the processing time of a job is defined by the function of its starti

Scheduling maintenance and semiresumable

Scheduling maintenance and semiresumable jobs on a single machine

✍ Gregory H. Graves; Chung-Yee Lee 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 349 KB 👁 1 views

The majority of scheduling literature assumes that the machines are available at all times. In this paper, we study single machine scheduling problems where the machine maintenance must be performed within certain intervals and hence the machine is not available during the maintenance periods. We al