Search
Now showing items 1-10 of 12
Scheduling of automated guided vehicles in a decision making hierarchy
(Taylor & Francis, 1996)
Scheduling efforts made without considering the special limitations of the material handling system might lead to infeasible results. An analytical model is proposed, first, to incorporate the automated guided vehicle (AGV) ...
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 ...
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 ...
Generating short-term observation schedules for space mission projects
(Kluwer Academic Publishers, 1999)
In this paper, we propose a new dispatching rule and a set of local search algorithms based on the filtered beam search, GRASP and simulated annealing methodologies to construct short-term observation schedules of space ...
Integrated scheduling and tool management in flexible manufacturing systems
(Taylor & Francis, 2001)
A multistage algorithm is proposed that will solve the scheduling problem in a flexible manufacturing system by considering the interrelated subproblems of processing time control, tool allocation and machining conditions ...
An overview of design and operational issues of kanban systems
(Taylor & Francis, 1999)
We present a literature review and classification of techniques to determine both the design parameters and kanban sequences for just-in-time manufacturing systems. We summarize the model structures, decision variables, ...
A new dominance rule for the total weighted tardiness problem
(Taylor & Francis, 1999)
We present a new dominance rule for the single machine total weighted tardiness problem with job dependent penalties. The proposed dominance rule provides a sufficient condition for local optimality. We show that if any ...
Match-up scheduling under a machine breakdown
(Elsevier, 1999)
When a machine breakdown forces a modified flow shop (MFS) out of the prescribed state, the proposed strategy reschedules part of the initial schedule to match up with the preschedule at some point. The objective is to ...
An exact approach to minimizing total weighted tardiness with release dates
(Kluwer Academic Publishers, 2000)
The study deals with scheduling a set of independent jobs with unequal release dates to minimize total weighted tardiness on a single machine. We propose new dominance properties that are incorporated in a branch and bound ...
Scheduling with tool changes to minimize total completion time: a study of heuristics and their performance
(John Wiley & Sons, Inc., 2003)
The machine scheduling literature does not consider the issue of tool change. The
parallel literature on tool management addresses this issue but assumes that the change is due
only to part mix. In practice, however, a ...