✦ LIBER ✦

Solving problems in production scheduling

✍ Scribed by Robin Lane; Stephen Evans

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 1012 KB
Volume: 8
Category: Article
ISSN: 0951-5240
DOI: 10.1016/0951-5240(95)00005-e

No coin nor oath required. For personal study only.

✦ Synopsis

Traditionally, production scheduling has been viewed as a problem-solving task that involves a single problem -generation of a suitable schedule. This paper presents an alternative model in which individual difficulties are viewed as problems, and the task is to maintain a suitable schedule by resolving as many of these problems as possible. Decision support software is described that has facilities for defining policies to handle numerous minor problems and complete problem-solving strategies to deal with major problems. The paper then discusses the potential for this style of decision support to improve the performance of human schedulers.

📜 SIMILAR VOLUMES

Using metaheuristics for solving a produ

Using metaheuristics for solving a production scheduling problem in a chemical firm. A case study

✍ Ph. Fortemps; Ch. Ost; M. Pirlot; J. Teghem; D. Tuyttens 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 983 KB

An implementation of Lagrangian decompos

An implementation of Lagrangian decomposition in solving a multi-item production scheduling problem with changeover cost and restrictions

✍ R.R. Vemuganti; H. Arsham; S.P. Shao Jr 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 730 KB

Solving large scale crew scheduling prob

Solving large scale crew scheduling problems

✍ Hai D. Chu; Eric Gelman; Ellis L. Johnson 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 572 KB

The crew pairing problem is posed as a set partitioning zero-one integer program. Variables are generated as legal pairings meeting all work rules. Dual values obtained from solving successive large linear program relaxations are used to prune the search tree. In this paper we present a graph based

Solving a bicriterion scheduling problem

✍ Luc N. Van Wassenhove; Ludo F. Gelders 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 880 KB

Solving the open shop scheduling problem

✍ Ulrich Dorndorf; Erwin Pesch; Toàn Phan-Huy 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 128 KB

Only few exact solution methods are available for the open shop scheduling problem. We describe a branch-and-bound algorithm for solving this problem which performs better than other existing algorithms. The key to the e ciency of our algorithm lies in the following approach: instead of analysing an

Production scheduling problems in a text

Production scheduling problems in a textile industry

✍ Paolo Serafini; M. Grazia Speranza 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 977 KB