This paper attempts to solve a two-machine ¯owshop bicriteria scheduling problem with release dates for the jobs, in which the objective function is to minimize a weighed sum of total ¯ow time and makespan. To tackle this scheduling problem, an integer programming model with N 2 +3N variables and 5N
A bicriteria flowshop scheduling with a learning effect
✍ Scribed by Tamer Eren; Ertan Güner
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 221 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0307-904X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The problem attacked in this paper is the scheduling of n jobs on two machines which are assumed to be continuously available. All jobs are available at the beginning of the scheduling period. Setup times are included in the processing times. No preemption of jobs is allowed. The objective is the mi
We consider the problem of sequencing jobs on a single machine while minimizing a nondecreasing function of two criteria. We develop a heuristic procedure that quickly finds a good solution for bicriteria scheduling. The procedure is based on using several arcs in the criterion space that are repres