Scheduling Job Families on a Single Machine
The problem of scheduling n jobs on a single machine is considered, where the jobs are partitioned into several families and a set – up time is necessary between jobs of different families. The objective is to find a lower bound for the problem of minimizing the sum of completion times and the maxi...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Baghdad, College of Science for Women
2010-12-01
|
| Series: | مجلة بغداد للعلوم |
| Subjects: | |
| Online Access: | https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/11937 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|