Name
Title | ||
|---|---|---|
Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times. |
Abstract | ||
|---|---|---|
We consider a single-machine common due-window assignment scheduling problem, in which the processing time of a job is a function of its position in a sequence and its resource allocation. The window location and size, along with the associated job schedule that minimizes a certain cost function, are to be determined. This function is made up of costs associated with the window location, window size, earliness, and tardiness. For two different processing time functions, we provide a polynomial time algorithm to find the optimal job sequence and resource allocation, respectively. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1142/S0217595914500365 | ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH |
Keywords | Field | DocType |
Scheduling,learning effect,single-machine,resource allocation,due-window,polynomial time algorithm | Learning effect,Mathematical optimization,Tardiness,Job shop scheduling,Computer science,Scheduling (computing),Real-time computing,Resource allocation,Time complexity | Journal |
Volume | Issue | ISSN |
31 | 5 | 0217-5959 |
Citations | PageRank | References |
3 | 0.38 | 29 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jibo Wang | 1 | 745 | 41.50 |
| Ming-Zheng Wang | 2 | 3 | 0.38 |