Name
Abstract | ||
|---|---|---|
The problem of scheduling jobs with a common due date d so that the weighted number of late jobs is minimized is considered for two machine open, flow, and job shops. NP-hardness proofs as well as optimization algorithms that run in time polynomial in d and the number of jobs are given for all three shop models. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0167-6377(94)90041-8 | Oper. Res. Lett. |
Keywords | Field | DocType |
optimization algorithm,weighted number,late job,job shop,common due date,np-hard,dynamic programming,shop model,time polynomial,np-hardness proof,flow shop,open shop,scheduling shop,np hard | Open shop,Dynamic programming,Mathematical optimization,Multiprocessor scheduling,Polynomial,Scheduling (computing),Job shop,Flow shop scheduling,Time complexity,Mathematics | Journal |
Volume | Issue | ISSN |
16 | 5 | Operations Research Letters |
Citations | PageRank | References |
23 | 2.25 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joanna Józefowska | 1 | 324 | 25.14 |
| Bernd Jurisch | 2 | 297 | 40.62 |
| Wieslaw Kubiak | 3 | 540 | 62.61 |