Article history: Received 11 November 2009 Accepted 15 June 2010 Available online 22 June 2010

The problem of sequencing and scheduling airplanes landing and taking off on a runway is under consideration. We propose a new family of valid inequalities which are obtained from the study of the single machine scheduling problem polytope.

Scheduling problems with learning effect have been widely studied and discussed. However, there are situations that the forgetting effect might exist as well. In this paper, we propose a model with the considerations of both effects. We then derive the optimal schedules for some single-machine scheduling problems.

We consider the scheduling problems arising when several agents, each owning a set of nonpreemptive jobs, compete to perform their respective jobs on one shared processing resource. Each agent wants to minimize a certain cost function, which depends on the completion times of its jobs only. The cost functions we consider in this paper are maximum of regular functions (associated with each job),...

in this paper, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. we concern rework in the scheduling environment and propose a mixed-integer programming (mip) model for the problem.  based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...

This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...