Search
Now showing items 1-10 of 55
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) ...
Optimal allocation and processing time decisions on non-identical parallel CNC machines: ε{lunate}-constraint approach
(ElsevierElsevier, 2007-12-01)
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the
scheduling performance. A well known example for such a case that this paper specifically deals with ...
Scheduling with tool changes to minimize total completion time under controllable machining conditions
(Elsevier, 2007-07)
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly
due to tool wear, has just begun to receive attention. Though machining conditions impact tool ...
Dynamic lot sizing and scheduling in cellular manufacturing systems using hybrid simulation analytic model
(International Journal of Industrial Engineering, 1995)
In most of the production systems, lot-sizing and scheduling decisions are made at different levels of hierarchy; although there is a strong interaction between these decisions. Furthermore, most of the existing models do ...
Rescheduling frequency in an FMS with uncertain processing times and unreliable machines
(Elsevier, 1999)
This paper studies the scheduling/rescheduling problem
in a multi-resource FMS environment. Several reactive
scheduling policies are proposed to address the effects of
machine breakdowns and processing time variations. ...
Satisfying due-dates in the presence of sequence dependent family setups with a special comedown structure
(Elsevier, 2007-12-22)
This paper addresses a static, n-job, single-machine scheduling problem with sequence dependent family setups. The
setup matrix follows a special structure where a constant setup is required only if a job from a smaller ...
Scheduling with tool changes to minimize total completion time: basic results and SPT performance
(Elsevier, 2004-09-16)
We consider a single machine sequencing problem subject to tool wear, where the objective is to minimize the total
completion time. We briefly describe the problem and discuss its properties, complexity and solution. ...
Scheduling with neural networks: A review of the literature and new research directtions
(Taylor & Francis, 1998)
Artificial neural networks ( ANNs) attempt to emulate the massively parallel and distributed processing of the human brain. They are being examined for a variety of problems that have been di cult to solve with current ...
Single machine earliness-tardiness scheduling problems using the equal-slack rule
(Palgrave Macmillan Ltd., 1994)
The purpose of this paper is to analyze a special case of the non-pre-emptive single machine scheduling problem where the distinct due dates for each job are related to processing times according to the Equal-Slack rule. ...
Parallel dedicated machine scheduling with a single server: full precedence case
(IIE, 2004)
The motivation for this study was the observation of a practical scenario that involves scheduling of two parallel machines attended by a single setup crew so as to minimize the makespan. This problem is known in scheduling ...