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,...

Under intensified pressure from both domestic and foreign competition, today′s manufacturers must strive to keep delivery promises and reduce waste. This depends largely on a manufacturer′s ability to assign accurate and attainable due‐dates. Presents an analytical method of assigning...

This paper addresses a batch delivery single-machine scheduling problem in which jobs have an assignable common due window. Each job will incur an early (tardy) penalty if it is early (tardy) with respect to the common due window under a given schedule. There is no capacity limit on each...

Scheduling with learning effects has continued to attract the attention of scheduling researchers. However, the majority of the research on this topic has been focused on the single-machine setting. Moreover, under the commonly adopted learning model in scheduling, the actual processing time of...