𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing the number of tardy jobs in multi-period cell loading problems

✍ Scribed by Gürsel A. Süer

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
321 KB
Volume
33
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

✦ Synopsis

Mayag~¢z, PR 00681-5000

#bstract

Cellular Manufacturing is gaining more acceptance in the indnst~. The Im'fommnce of a cellular manufacturing system can be further improved by addressing planning issues as well. The objective of this paper is to minimize the number of tsrdy jobs in a multi-pariod environment. Differem approaches are discussed and mathematical formulations are presented aice.g with the advantages and disadvantages of each approach. Later, the results of each approach are illustrated with a simple example problem. Finally, po~ble extensions to the models are discussed.

📜 SIMILAR VOLUMES

Minimizing the number of tardy jobs in s
Minimizing the number of tardy jobs in single machine sequencing
✍ Ahmad H. Sharary; Nejib Zaguia 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 568 KB

A set P of n jobs has to be processed without preemption, one job at a time, on a single machine. The weight and processing time of each job is one. Furthermore, the jobs are subject to precedence constraints represented by a given ordered set (P, <). In a feasible schedule a job is called a tardy j