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
Bicriteria robotic cell scheduling
β Scribed by Hakan Gultekin; M. Selim Akturk; Oya Ekin Karasan
- Book ID
- 106429547
- Publisher
- Springer US
- Year
- 2007
- Tongue
- English
- Weight
- 560 KB
- Volume
- 11
- Category
- Article
- ISSN
- 1094-6136
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
## Abstract Optimizationβbased computer systems are used by many airlines to solve crew planning problems by constructing minimal cost tours of duty. However, today airlines do not only require cost effective solutions, but are also very interested in robust solutions. A more robust solution is und