Now showing items 1-4 of 4
Job shop scheduling with beam search
(Elsevier Science B.V., Amsterdam, Netherlands, 1999)
Beam Search is a heuristic method for solving optimization problems. It is an adaptation of the branch and bound method in which only some nodes are evaluated in the search tree. At any level, only the promising nodes are ...
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) ...
A new dominance rule to minimize total weighted tardiness with unequal release dates
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 ...
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. ...