The discrete lotsizing and scheduling problem for one machine with sequence dependent setup times and setup costs is solved as a single machine scheduling problem, which we term the batch sequencing problem. The relationship between the lotsizing problem and the batch sequencing problem is analyzed. The batch sequencing problem is solved with a branch & bound algorithm which is accelerated by b...

We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the constraint matrix and the right-hand side. The problem has the following form: given a set of operations to be executed along a time horizon, find a schedule to minimize a function included by the expected operations cos...

We develop algorithms for a single machine stochastic appointment sequencing and scheduling problem with waiting time, idle time, and overtime costs. This is a basic stochastic scheduling problem that has been studied in various forms by several previous authors. Applications for this problem cited previously include scheduling of surgeries in an operating room (Denton, 2007, Denton and Gupta,2...

We formulate and solve a new stochastic integer programming model for dynamic sequencing and scheduling of appointments to a single stochastic server. We assume that service durations and the number of customers to be served on a particular day are uncertain. Customers are sequenced and scheduled dynamically (on-line) one at a time as they request appointments. We present a two-stage stochastic...

W consider a complex planning problem in integrated steel production. A sequence of coils of sheet metal needs to be color coated in consecutive stages. Different coil geometries and changes of colors necessitate time-consuming setup work. In most coating stages one can choose between two parallel color tanks. This can either reduce the number of setups needed or enable setups concurrent with p...

In Yangtze River traffic management, to manage ship sequencing and scheduling effectively efficiently in restricted waterways has long been a challenging issue. This paper proposes Sliding Window based Online Sequencing Scheduling algorithm (OSS-SW) tackle this problem. The OSS is capable of generating more efficient sequence by introducing the ‘position shift’ concept which takes advantages sh...

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.

introduction: the major resistance mechanisms of pseudomonas aeruginosa to fluoroquinolones and carbapenems are associated with the mutations in the genes gyra and oprd encoding type ii topoisomerases (dna gyrase) and oprd porin, respectively. method: in this cross-sectional study, sixty five clinical samples were collected from patients hospitalized in al-zahra hospital of isfahan, iran. susce...

The ever-increasing demands for surgeries and the limited resources force hospitals to have efficient management of resources, especially the expensive ones like operating rooms (ORs). Scheduling surgeries including sequencing them, assigning resources to them and determining their start times is a complicated task for hospital managers. Surgery referrals usually include elective surgeries that...