Now showing items 1-4 of 4
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. ...
Tool allocation and machining conditions optimization for CNC machines
In the literature, there exist many variations of machining economics problem in terms of modelling approaches and solution methodologies. However most of the existing studies focus on the single machining operation which ...
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 ...
New characterizations of ℓ1 solutions to overdetermined systems of linear equations
New characterizations of the ℓ1 solutions to overdetermined system of linear equations are given. The first is a polyhedral characterization of the solution set in terms of a special sign vector using a simple property of ...