We study the order acceptance and scheduling problem in a two-machine flowshop. The firm receives a pool of orders before a planning period, each of which is characterized by revenue, processing times on machines 1 and 2, a due date, and a tardiness penalty. The firm seeks to decide on the...

In this paper we study subcontracting price schemes between a subcontractor and a firm that are engaged in subcontracting of heterogeneous orders with distinct due dates, revenues, and processing times. We assume that the subcontractor proposes the subcontracting pricing and the firm follows by...

We study a two identical parallel-machine scheduling problem in which one machine is available to process jobs in a limited time interval while the other machine is always available over the scheduling horizon. The objective is to maximize the number of on-time jobs. As the problem is NP-hard,...

We study a logistics scheduling problem where a manufacturer receives raw materials from a supplier, manufactures products in a factory, and delivers the finished products to a customer. The supplier, factory and customer are located at three different sites. The objective is to minimize the sum...

We consider the identical parallel-machine scheduling problem in which both job class setups for job processing and product delivery are required. A setup time is incurred for a job if it is the first job to be processed on a machine or its processing on a machine follows a job that belongs to...