search query: @author Nowicki, E. / total: 4
reference: 3 / 4
| Author: | Nowicki, E. Zdrzalka, S. |
| Title: | A two-machine flow shop scheduling problem with controllable job processing time |
| Journal: | European Journal of Operational Research
1988 : MAR, VOL. 34:2, p.208-220 |
| Index terms: | SCHEDULING HEURISTIC METHODS DECISION MAKING |
| Language: | eng |
| Abstract: | A two machine shop scheduling problem is analyzed in which both the sequence of jobs and their processing times are decision variables. It is assumed that the cost of performing a job is a linear function of its processing time, and the schedule cost to be minimized is the total processing cost plus maximum completion time cost. It is shown that the decision form of this problem is NP-complete even when the processing times on one machine only are controllable and all the processing cost units are identical. Two heuristic methods for solving the problem are proposed and their worst-case analysis is presented. |
SCIMA