Browsing by Subject "Heuristic programming."
Now showing items 1-2 of 2
-
Assembly job shop scheduling problems with component availability constraints.
(2007)Job shop scheduling has been widely studied for several decades. In generalized of the job shop scheduling problem, n jobs are to be processed on m machines under specific routings and due dates. The majority of job shop ... -
Quality of service routing on wide area networks.
(2000)Moore [20] introduced the quickest path problem and it has been studied extensively in recent times. The quickest path problem is to determine a routing path to minimize end-to-end delay from the source to the destination ...