Search
Now showing items 1-10 of 29
Reactive scheduling in a dynamic and stochastic FMS environment
(Taylor & Francis, 2003)
In this paper, we study the reactive scheduling problems in a dynamic and stochastic manufacturing environment. Specifically, we develop a simulationbased scheduling system for flexible manufacturing systems. We also propose ...
Satisfying due-dates in a job shop with sequence-dependent family set-ups
(Taylor & Francis, 2003)
This paper addresses job shop scheduling with sequence dependent family set-ups. Based on a simple, single-machine dynamic scheduling problem, state dependent scheduling rules for the single machine problem are developed ...
A problem space genetic algorithm in multiobjective optimization
(Springer New York LLC, 2003)
In this study, a problem space genetic algorithm (PSGA) is used to solve bicriteria tool management and scheduling problems simultaneously in flexible manufacturing systems. The PSGA is used to generate approximately ...
Non-identical parallel CNC machine scheduling
(Taylor & Francis, 2003)
In this study, we solve the non-identical parallel CNC machine scheduling problem. We have two objectives: minimizing the manufacturing cost (comprising machining, non-machining and tooling costs) and minimizing the total ...
A problem space algorithm for single machine weighted tardiness problems
(Taylor & Francis Inc., 2003)
We propose a problem space genetic algorithm to solve single machine total weighted tardiness scheduling problems. The proposed algorithm utilizes global and time-dependent local dominance rules to improve the neighborhood ...
Operation-based flowtime estimation in a dynamic job shop
(Elsevier, 2002)
In the scheduling literature, estimation of job owtimes has been an important issue since the late 1960s. The previous studies focus on the problem in the context of due date assignment and develop methods using aggregate ...
A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
(Elsevier, 2005)
In this study, we determine the upper and lower bounds for the processing time of each job under controllable machining conditions. The proposed bounding scheme is used to find a set of discrete efficient points on the ...
Analysis of reactive scheduling problems in a job shop environment
(Elsevier, 2000)
In this paper, we study the reactive scheduling problems in a stochastic manufacturing environment. Specifically, we test the several scheduling policies under machine breakdowns in a classical job shop system. In addition, ...
A new dominance rule to minimize total weighted tardiness with unequal release dates
(Elsevier, 2001)
We present a new dominance rule by considering the time-dependent orderings between each pair of jobs for the single machine total weighted tardiness problem with release dates. The proposed dominance rule provides a ...
Effect of load, processing time and due date variation on the effectiveness of scheduling rules
(Taylor & Francis, 2002)
In real manufacturing environments, variations in production factors (i.e. pro- cessing time, demand, due-dates) are inevitable facts. All these dynamic changes, together with random disturbances (e.g. machine breakdowns) ...