EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1246. Scheduling on parallel dedicated machines with job rejection
Invited abstract in session MB-26: Novel topics and recent advances in solution approaches in scheduling, stream Combinatorial Optimization.
Monday, 10:30-12:00Room: 012 (building: 208)
Authors (first author is the speaker)
| 1. | Baruch Mor
|
| Department of Economics and Business Administration, Ariel University | |
| 2. | Gur Mosheiov
|
| School of Business, Hebrew University |
Abstract
We study scheduling problems on parallel dedicated machines. Thus, each job can be processed on one specific machine only. The option of job-rejection is considered, and the total permitted rejection cost of all the jobs is bounded. Six scheduling problems are solved: (i) minimizing makespan, (ii) minimizing makespan with release-dates, (iii) minimizing total completion time, (iv) minimizing total weighted completion time, (v) minimizing total load, and (vi) minimizing maximum tardiness. Pseudo-polynomial dynamic programming algorithms are introduced for all these NP-hard problems.
Keywords
- Scheduling
- Combinatorial Optimization
- Programming, Dynamic
Status: accepted
Back to the list of papers