✦ LIBER ✦

Solving a Class of Job-Shop Scheduling Problem based on Improved BPSO Algorithm

✍ Scribed by Kun FAN; Ren-qian ZHANG; Guo-ping XIA

Publisher: Elsevier
Year: 2007
Weight: 209 KB
Volume: 27
Category: Article
ISSN: 1874-8651
DOI: 10.1016/s1874-8651(08)60067-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A method of solving scheduling problems

A method of solving scheduling problems using an improved guided genetic algorithm

✍ Gyouhi Ou; Hiroki Tamura; Koichi Tanno; Zheng Tang 📂 Article 📅 2010 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 951 KB

The open shop scheduling problem with a

The open shop scheduling problem with a given sequence of jobs on one machine

✍ Y.M. Shafransky; V.A. Strusevich 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 2 views

The paper considers the open shop scheduling problem to minimize the makespan, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not a

A tutorial survey of job-shop scheduling

A tutorial survey of job-shop scheduling problems using genetic algorithms: Part II. Hybrid genetic search strategies

✍ Runwei Cheng; Mitsuo Gen; Yasuhiro Tsujimura 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Job-shop scheduling problem is one of the well-known hardest combinatorial optimization problems. During the past decade, two important issues have been extensively studied. One is how to encode a solution into a chromosome so as to ensure that a chromosome will correspond to a feasible solution. Th

A tutorial survey of job-shop scheduling

A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies

✍ Runwei Cheng; Mitsuo Gen; Yasuhiro Tsujimura 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 224 KB

Job-shop scheduling problem is one of the well-known hardest combinatorial optimization problems. During the last three decades, this problem has captured the interest of a signi®cant number of researchers. A lot of literature has been published, but no ecient solution algorithm has been found yet f

Computational experience with a backtrac

Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems

✍ James H. Patterson; F. Brian Talbot; Roman Slowinski; Jan Wegłarz 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 895 KB

A weighted algorithm based on Adomian de

A weighted algorithm based on Adomian decomposition method for solving an special class of evolution equations

✍ A. Shidfar; M. Garshasbi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 173 KB

A particular PDE having nonlinear advection, diffusion and reaction subject to initial and boundary conditions is investigated by using an algorithm based on Adomian decomposition method. This algorithm uses initial and boundary conditions simultaneously and effectively for constructing the solution