De Werra, D. and J. Blazewicz, Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource, Discrete Applied Mathematics 35 (1992) 205-219. An edge coloring model is presented for a preemptive open shop problem. Constraints generated by a single resource have to be taken into account. The case of a renewable and of a nonrenewable resource as considered. Since the e...

We consider a variation of the classical nonpreemptive open-shop scheduling problem. For the normal open shop, finding whether a schedule exists in T time units is NP-complete [2]. The main difference with the classical model is that we will consider so-called periodical or cyclic schedules; this means that the schedule obtained is repeated periodically. If the length of a period is k time unit...

In most manufacturing and distribution systems, semi-finished jobs are transferred from one processing facility to another by transporters such as Automated Guided Vehicles, robots and conveyors, and finished jobs are delivered to warehouses or customers by vehicles such as trucks. This paper investigates two-machine flow shop scheduling problems taking transportation into account. The finished...

In this paper we consider a repair shop location problem with uncertainties in demand. New repair shops have to be opened at a number of locations. At these local repair shops, customers arrive with broken, but repairable, items. Customers go to the nearest open repair shop. Since they want to leave as soon as possible, an inventory of working items is kept at the repair shops. A customer immed...

We study the LowerBoundedCenter (LBC) problem, which is a clustering problem that can be viewed as a variant of the k-Center problem. In the LBC problem, we are given a set of points P in a metric space and a lower bound λ, and the goal is to select a set C ⊆ P of centers and an assignment that maps each point in P to a center of C such that each center of C is assigned at least λ points. The p...

Batch processing machines are commonly used in wafer fabrication, kilns, and chambers used for environmental stress screening (ESS). This paper proposes two models to schedule batches of jobs on two machines in a flow shop. A set of jobs with known processing times and sizes has to be grouped, to form batches, in order to be processed on the batch processing machines. The jobs are nonidentical ...

In the job shop scheduling problem (JSP), a set of N jobs = {J1, J2, . . . , JN} is to be processed on a set of m machines M = {1, 2, . . . ,m}. Each job requires a sequence of operations that must be accomplished according to its manufacturing process Ji = {Oi1, Oi2, . . . , Oim}. Operation Oij requires a processing time of pij time units on machine Mij ∈ M . Each machine can perform at most o...