✦ LIBER ✦

A hierarchical approach for the FMS scheduling problem

✍ Scribed by Jan Paulli

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 857 KB
Volume: 86
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(95)00059-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Operations planning and scheduling probl

Operations planning and scheduling problems in an FMS: An integrated approach

✍ N.S. Mohamed 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 543 KB

Mathematical programming for the schedul

Mathematical programming for the scheduling problem with alternate process plans in FMS

✍ Juichin Jiang; Wen-chieh Hsiao 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 235 KB

A global MILP model for FMS scheduling

✍ Jiyin Liu; B.L. MacCarthy 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 993 KB

Flexible manufacturing systems (FMS) require intelligent scheduling strategies to achieve their principal benefitcombining high flexibility with high productivity. A mixed-integer linear programming model (MILP) is presented here for FMS scheduling. The model takes a global view of the problem and s

A branch-and-price algorithm for a hiera

A branch-and-price algorithm for a hierarchical crew scheduling problem

✍ Diego B.C. Faneyte; Frits C.R. Spieksma; Gerhard J. Woeginger 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 1 views

## Abstract We describe a real‐life problem arising at a crane rental company. This problem is a generalization of the basic crew scheduling problem given in Mingozzi et al. [18] and Beasley and Cao [6]. We formulate the problem as an integer programming problem and establish ties with the integer

A tabu search approach for the flow shop

A tabu search approach for the flow shop scheduling problem

✍ M. Ben-Daya; M. Al-Fawzan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 788 KB

In this paper, we propose a tabu search approach for solving the permutation flow shop scheduling problem. The proposed implementation of the tabu search approach suggests simple techniques for generating neighborhoods of a given sequence and a combined scheme for intensification and diversification

An approximation algorithm for the prece

An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications

✍ Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude König 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 153 KB

We study the problem of minimizing the makespan for the precedence multiprocessor constrained scheduling problem with hierarchical communications (Parallel Process. Lett. 10(1) (2000) 133). We propose an 8 5 -approximation algorithm for the Unit Communication Time hierarchical problem with arbitrary