Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Flexible Job-Shop Scheduling Problems

Flexible Job-Shop Scheduling Problems
View Sample PDF
Author(s): Imed Kacem (Universite de Technologie de Troyes, France)
Copyright: 2005
Pages: 4
Source title: Encyclopedia of Information Science and Technology, First Edition
Source Author(s)/Editor(s): Mehdi Khosrow-Pour, D.B.A. (Information Resources Management Association, USA)
DOI: 10.4018/978-1-59140-553-5.ch211


View Flexible Job-Shop Scheduling Problems on the publisher's website for pricing and purchasing information.


Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Carlier & Chr├ętienne, 1988). They consist generally in a simultaneous optimization of a set of non-homogeneous and conflicting goals. Therefore, the exact algorithms such as branch and bound, dynamic programming, and linear programming are not suitable for such problems and need a lot of time and memory to converge.

Related Content

Adeyinka Tella, Oluwakemi Titilola Olaniyi, Aderinola Ololade Dunmade. © 2021. 24 pages.
Md. Maidul Islam. © 2021. 17 pages.
Peterson Dewah. © 2021. 23 pages.
Lungile Precious Luthuli, Thobekile K. Buthelezi. © 2021. 14 pages.
Delight Promise Udochukwu, Chidimma Oraekwe. © 2021. 13 pages.
Julie Moloi. © 2021. 18 pages.
Mandisa Msomi, Lungile Preciouse Luthuli, Trywell Kalusopa. © 2021. 17 pages.
Body Bottom