We study the problem of minimizing the weighted number of tardy jobs on a single machine with deterministic machine availability constraints. We show that the cases with resumable and non-resumable jobs (1, hk|ri, nr − a| ∑ wiUi and 1, hk|ri, r − a| ∑ wiUi) can both be modeled as a more general scheduling problem, consisting in selecting and scheduling jobs on parallel machines subject to time ...

Article history: Received 10 March 2010 Received in revised form July, 25, 2011 Accepted 26 July 2011 Available online 27 July 2011 This paper presents a mathematical model for the problem of minimizing the maximum lateness on a single machine when the deteriorated jobs are delivered to each customer in various size batches. In reality, this issue may happen within a supply chain in which deliv...

We consider optimal mechanism design for a sequencing problem with n jobs which require a compensation payment for waiting. The jobs’ processing requirements as well as unit costs for waiting are private data. Given public priors for this private data, we seek to find an optimal mechanism, that is, a scheduling rule and incentive compatible payments that minimize the total expected payments to ...

This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...

The design of a supply chain has been considered by many practitioners and researchers recently. One model that is used to optimize distribution from a single facility (depot) to a set of retailers over a given planning horizon and considering stock management decisions is known as Inventory Routing Problem (IRP). This model tries to optimize the trade-off between inventory and transportation c...

We consider the general problem of scheduling a set of jobs where we may choose not to schedule certain jobs, and thereby incur a penalty for each rejected job. More specifically, we focus on choosing a set of jobs to reject and constructing a schedule for the remaining jobs so as to optimize the sum of the weighted completion times of the jobs scheduled plus the sum of the penalties of the job...

A set of jobs need to be served by a server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The jobs share their costs through compensation using monetary transfers. In the first part, we provide an axiomatic characterization of the Shapley value rule by introducing some fairness axioms that are new in the literature. In...