We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m =2...

A companion paper (Part I) considers the problem of minimizing the weighted earliness and tardiness of jobs scheduled on a single machine around a common due date, d, which is unrestrictively late. This paper (Part II) considers the problem of minimizing the unweighted earliness and tardiness of...

Part-orienting systems are employed in many manufacturing environments to feed work parts in correct orientation for proper operations. A part-orienting system is a serial arrangement of orienting devices; the selection and ordering of these devices is an important design aspect that is...

In many manufacturing systems, parts must be fed to automatic machines in a specific orientation. This is often accomplished by what are known as part-orienting systems (POSs). A POS consists of one or more separate devices that orient parts, usually with multiple orientations. A theoretical...

We study the problem of scheduling a chain-reentrant shop, in which each job goes for its processing first to a machine called the primary machine, then to a number of other machines in a fixed sequence, and finally back to the primary machine for its last operation. The problem is to schedule...

We consider a novel generalization of the resource-constrained project scheduling problem (RCPSP). Unlike many established approaches for the RCPSP that aim to minimize the makespan of the project for given static capacity constraints, we consider the important real-life aspect that capacity...