Polynomial Algorithm for Constructing Pareto-Optimal Schedules for Problem 1∣<em>r</em><sub>j</sub>∣<em>L</em><sub>max</sub>,<em>C</em><sub>max</sub>
In this chapter, we consider the single machine scheduling problem with given release dates, processing times, and due dates with two objective functions. The first one is to minimize the maximum lateness, that is, maximum difference between each job due date and its actual completion time. The seco...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Ebooks |
| Published: |
IntechOpen,
2020-11-02.
|
| Subjects: | |
| Online Access: | Get Online |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Online3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |