Algorithms for series-parallel graphs can be extended to arbitrary two-terminal dags if node reductions are used along with series and parallel reductions. A node reduction contracts a vertex withâ€¦ (More)

Algorithms for series-parallel graphs can be extended to arbitrary two-terminal dags if node reductions are used along with series and parallel reductions. A node reduction contracts a vertex withâ€¦ (More)

If a certain optimization problem is NP-hard or even harder, one could expect that the chances of solving it optimally should rather decrease with an increase of the problem size. We reveal, however,â€¦ (More)

For over 20 years the NEH heuristic of Nawaz, Enscore, and Ham [A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, The International Journal of Management Scienceâ€¦ (More)

Flowshop Scheduling is used to determine the optimal sequence of n jobs to be processed on m machines in the same order. Permutation Flowshop Scheduling Problems (PFSP) require same job sequence onâ€¦ (More)

Recently in this journal Saadani, Guinet, and Moalla [Comput Ind Engng 44 (2003) 425] considered the NP-hard problem of minimizing the makespan in a three-machine no-idle flow shop. We identify aâ€¦ (More)

New theoretical foundations for analyzing the newsboy problem under incomplete information about the probability distribution of random demand are presented. Firstly, we reveal that theâ€¦ (More)