We study a common due-date assignment problem on two parallel uniform machines. The jobs are assumed to have identical processing times, and job-dependent asymmetric earliness tardiness unit costs. scheduler may process only subset of the jobs, i.e. option job-rejection is allowed. objective function consists three cost components: total earliness-tardiness all scheduled due-date, rejection cos...

Yet, the few existing models considering learning effects in scheduling concentrate on learning-by-doing (autonomous learning). But recent contributions to the literature on learning in manufacturing organizations emphasize the important impact of proactive investments in technological knowledge on the learning rate (induced learning). In the present paper, we focus on a scheduling problem wher...

We consider a manufacturer, served by a single supplier, who has to quote due dates to arriving customers in a maketo-order production environment. The manufacturer is penalized for long lead times and for missing due dates. To meet due dates, the manufacturer has to obtain components from a supplier. We model this manufacturer and supplier as a two-machine flow shop, consider several variation...

We consider supply chain networks composed of several centrally managed production facilities as well as external suppliers. We design effective heuristics for inventory positioning, order sequencing, and short and reliable due date quotation for this supply chain. We perform extensive computational testing to assess the effectiveness of our algorithms, and we explore the impact of supply chain...

This paper studies the single machine scheduling problem for minimizing the expected total weighted deviations of completion times from random common due date. Jobs have exponentially distributed processing times and the common due date is a generalized Erlang distribution. The optimal schedules are shown to be ⁄-shaped. Moreover, we give the optimal schedules when the machine is subject to sto...