Search
Now showing items 1-10 of 12
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 ...
A beam search algorithm to optimize robustness under random machine breakdowns and processing time variability
(Institute of Industrial Engineers, 2007)
The vast majority of the machine scheduling research assumes complete information about the scheduling problem and a static environment in which scheduling systems operate. In practice, however, scheduling systems are ...
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 ...
Dynamic lot sizing and tool management in automated manufacturing systems
(Elsevier, 2002)
The overall aim of this study is to show that there is a critical interface between the lot sizing and tool
management decisions, and these two problems cannot be viewed in isolation. We propose "ve alternative
algorithms ...
Minimizing Lmax for the single machine scheduling problem with family set-ups
(Taylor & Francis, 2004)
A procedure for the single machine-scheduling problem of minimizing the maximum lateness for jobs with sequence independent set-ups is presented. The procedure provides optimal/near-optimal solutions over a wide range of ...
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 ...
Designing emergency response networks for hazardous materials transportation
(2007)
Undesirable consequences of dangerous goods incidents can be mitigated by quick arrival of specialized response teams at the accident site. We present a novel methodology to determine the optimal design of a specialized ...
A note on "continuous review perishable inventory systems: models and heuristics"
(2003)
In a recent paper, Lian and Liu (2001) consider a continuous review perishable inventory model with renewal arrivals, batch demands and zero lead times. However, the main analytical result they provide holds only for some ...
A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem
(IEEE, 2009)
In this paper, a new local search metaheuristic is proposed for the permutation flow-shop scheduling problem. In general, metaheuristics are widely used to solve this problem due to its NP-completeness. Although these ...
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 ...