This paper considers a scheduling problem with two identical parallel machines. One has unlimited capacity; the other can only run for a fixed time. A given set of jobs must be scheduled on the two machines with the goal of minimizing the sum of their completion times. The paper proposes an...

We consider an n-job, m-machine lot-streaming problem in a flowshop with equal-size sublots where the objective is to minimize the total weighted earliness and tardiness. To solve this problem, we first propose a so-called net benefit of movement (NBM) algorithm, which is much more efficient...

This paper is concerned with coordination aspects of supply chain management and, in particular, investigates setup coordination between two and three stages of a supply chain. The problem arises from a real application in the production chain of a kitchen furniture plant. In different stages of...

In the scheduling literature, it is often assumed that jobs arrive either simultaneously or individually. However, this assumption is invalid in most practical situations because jobs usually arrive in batches, e.g., the final testing house in the manufacturing of semiconductor. The concept of...

This paper considers a real-life identical parallel scheduling problem originating from the manufacturing plant producing polyvinyl chloride leather products. In the considered scheduling problem, each job has some attributes and each attribute has several different levels. Because there is at...

In recent years, many firms have become aware that environmental issues are critical barriers to the sustainability of a business. To overcome these barriers, several studies have been conducted to develop quantitative measurements associated with industry practices to prevent pollution and...