|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 232 of 247 found articles
| Title: |
The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times |
| Author: |
Shabtay, Dvir Kaspi, Moshe Steiner, George |
| Appeared in: |
IIE transactions |
| Paging: | Volume 39 (2007) nr. 5 pages 539-557 |
| Year: |
2007-05 |
| Contents: |
We extend the classical no-wait two-machine flow shop scheduling problem to the case where job-processing times are controllable through the allocation of a common, limited and nonrenewable resource. Our objective is to simultaneously determine the sequence of the jobs and the resource allocation for each job on both machines in order to minimize the makespan. By using the equivalent load method to obtain the optimal resource allocation on a series-parallel graph, we reduce the problem to a sequencing one and show that it is equivalent to a new special case of the Traveling Salesman Problem (TSP). We prove that although the reduced problem forms a subclass of the TSP on permuted Monge matrices, it is still strongly NP-hard. We provide an approximation result and present three special cases which are polynomially solvable. We have also tested two different subtour-patching heuristics in large-scale computational experiments on randomly generated instances of the problem. Both heuristics produced close-to-optimal solutions in most cases. |
| Publisher: |
Taylor & Francis |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 232 of 247 found articles
| << previous | next >> |