Search
Now showing items 1-10 of 53
New insights on the single machine total tardiness problem
(Palgrave Macmillan, 1997)
Virtually all algorithmic studies on the single machine total tardiness problem use Emmons' theorems that establish precedence relations between job pairs. In this paper, we investigate these theorems with a geometric ...
A neural network model for scheduling problems
(Elsevier, 1996)
Artificial neural networks (ANNs) have been successfully applied to solve a variety of problems. This paper proposes a new neural network approach to solve the single machine mean tardiness scheduling problem and the minimum ...
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) ...
Part-machine grouping using a multi-objective cluster analysis
(1996)
In the existing literature, the part-family formation problem is handled either by the coding systems or the cluster analysis. In this study, we propose a new method that will consider both design and manufacturing attributes ...
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 ...