Scheduling involving no-wait in process plays an important role in industries such as plastic,
chemical, and pharmaceutical. Moreover, many scheduling problems in other industries …

This article is a comprehensive review of Branch-and-Bound algorithms for solving flowshop
scheduling problems, from the early works of Ignall and Schrage (1965) and Brown and …

The real life scheduling problems often have several conflicting objectives. The solutions of
these problems can provide deeper insights to the decision maker than those of single …

We consider the m-machine no-wait flowshop scheduling problem with respect to two
performance measures; total tardiness and makespan. Our objective is to minimize total …

This article addresses the no-wait flowshop scheduling problem with simultaneous
consideration of common due date assignment, convex resource allocation and learning …

In this paper, the job shop scheduling problem with the objective to minimize the makespan
is discussed. A theorem on the shifting bottleneck procedure (SB) for solving this problem is …

In this paper, we address the two-stage assembly flowshop scheduling problem with a
weighted sum of makespan and mean completion time criteria, known as bicriteria. Since …

This article addresses the m-machine no-wait flowshop scheduling problem with the
objective of minimizing makespan subject to an upper bound on total completion time. An …

List of References on Evolutionary Multiobjective Optimization Page 1 List of References on
Evolutionary Multiobjective Optimization Carlos A. Coello Coello ccoello@cs.cinvestav.mx …

The m-machine no-wait flowshop scheduling problem with the objective of minimizing total
completion time subject to the constraint that the makespan value is not greater than a …