this paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. gaining an optimal s...

This paper discusses the problem of scheduling quay cranes, the most important equipment in port terminals. A simulation model is developed for evaluating time of quay cranes. Then a dynamic scheduling model using objective programming for quay cranes is developed based on genetic algorithm approach. Finally, numerical experiments on a specific container terminal are made for propose approach. ...

Multistart local search heuristics Remove and Reinsert that is based on a simple schedule constructing heuristics is tested on several benchmark instances of the job shop scheduling problem. The heuristics provides very good near optimal solutions within reasonably short computation time. The implementation within a plant simulation software is compared to the build-in genetic algorithm.

The resource-constrained project scheduling problem (RCPSP) is a significant challenge in highly regulated industries, such as pharmaceuticals and agrochemicals, where a large number of candidate new products must undergo a set of tests for certification. We propose a novel way of addressing the uncertainties in the RCPSP including the uncertainties in task durations and costs, as well as uncer...

We assume an open supply chain environment where organizations in a globalized trading scenario can sub-contract out sub-tasks to other organizations through a contracting process. Manufacturers are assumed to award sub-contracts to bidding suppliers using an auction scheme. Of particular interest in this environment is the task scheduling strategies used by suppliers in response to manufacture...

this paper addresses a new version of the exible ow line prob- lem, i.e., the budget constrained one, in order to determine the required num- ber of processors at each station along with the selection of the most eco- nomical process routes for products. since a number of parameters, such as due dates, the amount of available budgets and the cost of opting particular routes, are imprecise (fuzz...

This paper studies a non-preemptive infinite-horizon scheduling problem with a single server and a fixed set of recurring jobs. Each job is characterized by two given positive numbers: job duration and maximum allowable time between the job completion and its next start. We show that for a feasible problem there exists a periodic schedule. We also provide necessary conditions for the feasibilit...

The term flexible flow line (FFL) denotes a generalization of the standard flow shop where at least one stage comprises more than one machine. We present a scheduling algorithm for the FFL which minimizes a combination of job tardiness and machine utilization. To our knowledge, this is the first exact method that minimizes a tardiness based objective function for the given production facility. ...