The assembly flowshop scheduling problem has been studied recently due to its applicability in real life scheduling problems. It arises when various fabrication operations are performed concurrently in one stage. It was firstly introduced by Lee et al. (1993) in a flowshop environment. Later, Potts et al. (1995) considered the two-stage assembly flowshop problem with m concurrent operations in ...

This paper presents a new heuristic named GAPH based on a structural property for minimizing makespan in no-wait flowshop with sequence-dependent setup times. Experimental results demonstrate the superiority of the proposed approach over thhree of the best-know methods in the literature. Experimental and statistical analyses show that the new heuristic provides better solutions regarding the so...

The paper investigates train scheduling problems when prioritised trains and non-prioritised trains are simultaneously traversed in a single-line rail network. In this case, no-wait conditions arise because the prioritised trains such as express passenger trains should traverse continuously without any interruption. In comparison, non-prioritised trains such as freight trains are allowed to ent...

although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimizes the makespan. We present an adaptation of the Climbing Depth-bounded Discrepancy Search (CDDS) method based on Johnson’s rule and on ...

Two-machine flowshop scheduling to minimize makespan is one of the most well-known classical scheduling problems. Johnson's rule for solving this problem has been widely cited in the literature. We introduce in this paper the concept of composite job, which is an artificially constructed job with processing times such that it will incur the same amount of idle time on the second machine as that...