FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2155577945> ?p ?o ?g. }

• W2155577945 endingPage "173" @default.
• W2155577945 startingPage "159" @default.
• W2155577945 abstract "Abstract The semiautomatic nature of machinery often makes it economical to assign more than one machine to a single operator. Multi-machine assignments are common in the textile, tooling and molding industries. They are also found where numerically controlled (NC) machinery are used and, more recently, where flexible manufacturing systems (FMS) are employed. Previous work on deterministic cyclic scheduling models has focused on determining the optimal number of usually identical machines with single runs to assign to an operator. In practice, the schedules are represented by man/machine charts. When, due to production requirements, we mix different types of runs with known times on non-identical machines, we have the deterministic, single operator, multiple machine, multiple run, cyclic scheduling problem. We present two heuristics for solving this more realistic generalization of earlier problems. For the nonidentical, multiple run case, the scheduling of the runs is crucial in minimizing the cycle time of the system. The integer programming formulation of small problems is large, and solving it directly could require excessive computation time on a large mainframe computer. Heuristic 1 selects the next machine run to schedule by minimizing the total immediate waiting cost of the operator and machines. The hourly machine costs reflect the relative merit of utilizing certain machines over others. Heuristic 2 first schedules the machine with the longest automatic processing time of run one. It then follows Heuristic 1 until the long processing time of the first run has ended. The next available run with the longest automatic processing time is then scheduled, and the process repeats. The underlying notion is that many short runs may be performed during the long automatic run of a machine. The heuristics are polynomially bounded, can be easily implemented on a mini- or micro-computer and in practice should be much faster than integer programming methods. In addition to the heuristics, we compute a lower bound on the cycle time. We use this bound as a measure of the effectiveness of a solution. If for a given schedule, the cycle time equals its lower bound, then the solution is optimal. Both heuristics were coded in FORTRAN on a CDC-6600 computer. An interactive version was also developed for a DEC PDP11/70. A detailed computational study is presented. In it, both heuristics solved 50 machine, 5 run problems in less than 10 CPU seconds on the CDC-6600. Computational experience indicates that the heuristics are efficient and often find schedules which have cycle times within 10% the lower bound." @default.
• W2155577945 created "2016-06-24" @default.
• W2155577945 creator A5036789978 @default.
• W2155577945 date "1984-02-01" @default.
• W2155577945 modified "2023-09-26" @default.
• W2155577945 title "Two heuristics for the deterministic, single operator, multiple machine, multiple run cyclic scheduling problem" @default.
• W2155577945 cites W1965672966 @default.
• W2155577945 cites W2009127293 @default.
• W2155577945 cites W2081879189 @default.
• W2155577945 cites W2152619609 @default.
• W2155577945 doi "https://doi.org/10.1016/0272-6963(84)90030-5" @default.
• W2155577945 hasPublicationYear "1984" @default.
• W2155577945 type Work @default.
• W2155577945 sameAs 2155577945 @default.
• W2155577945 citedByCount "7" @default.
• W2155577945 crossrefType "journal-article" @default.
• W2155577945 hasAuthorship W2155577945A5036789978 @default.
• W2155577945 hasConcept C104317684 @default.
• W2155577945 hasConcept C111919701 @default.
• W2155577945 hasConcept C11413529 @default.
• W2155577945 hasConcept C126255220 @default.
• W2155577945 hasConcept C127705205 @default.
• W2155577945 hasConcept C158448853 @default.
• W2155577945 hasConcept C17020691 @default.
• W2155577945 hasConcept C185592680 @default.
• W2155577945 hasConcept C206729178 @default.
• W2155577945 hasConcept C2778047078 @default.
• W2155577945 hasConcept C2780271269 @default.
• W2155577945 hasConcept C33923547 @default.
• W2155577945 hasConcept C41008148 @default.
• W2155577945 hasConcept C45374587 @default.
• W2155577945 hasConcept C55416958 @default.
• W2155577945 hasConcept C55493867 @default.
• W2155577945 hasConcept C68387754 @default.
• W2155577945 hasConcept C86339819 @default.
• W2155577945 hasConceptScore W2155577945C104317684 @default.
• W2155577945 hasConceptScore W2155577945C111919701 @default.
• W2155577945 hasConceptScore W2155577945C11413529 @default.
• W2155577945 hasConceptScore W2155577945C126255220 @default.
• W2155577945 hasConceptScore W2155577945C127705205 @default.
• W2155577945 hasConceptScore W2155577945C158448853 @default.
• W2155577945 hasConceptScore W2155577945C17020691 @default.
• W2155577945 hasConceptScore W2155577945C185592680 @default.
• W2155577945 hasConceptScore W2155577945C206729178 @default.
• W2155577945 hasConceptScore W2155577945C2778047078 @default.
• W2155577945 hasConceptScore W2155577945C2780271269 @default.
• W2155577945 hasConceptScore W2155577945C33923547 @default.
• W2155577945 hasConceptScore W2155577945C41008148 @default.
• W2155577945 hasConceptScore W2155577945C45374587 @default.
• W2155577945 hasConceptScore W2155577945C55416958 @default.
• W2155577945 hasConceptScore W2155577945C55493867 @default.
• W2155577945 hasConceptScore W2155577945C68387754 @default.
• W2155577945 hasConceptScore W2155577945C86339819 @default.
• W2155577945 hasIssue "2" @default.
• W2155577945 hasLocation W21555779451 @default.
• W2155577945 hasOpenAccess W2155577945 @default.
• W2155577945 hasPrimaryLocation W21555779451 @default.
• W2155577945 hasRelatedWork W1967037696 @default.
• W2155577945 hasRelatedWork W1990985241 @default.
• W2155577945 hasRelatedWork W1994678498 @default.
• W2155577945 hasRelatedWork W2001414947 @default.
• W2155577945 hasRelatedWork W2007044196 @default.
• W2155577945 hasRelatedWork W2039740342 @default.
• W2155577945 hasRelatedWork W2053782818 @default.
• W2155577945 hasRelatedWork W2083771036 @default.
• W2155577945 hasRelatedWork W2102884185 @default.
• W2155577945 hasRelatedWork W2142276393 @default.
• W2155577945 hasRelatedWork W2145414605 @default.
• W2155577945 hasRelatedWork W2342198319 @default.
• W2155577945 hasRelatedWork W2390561736 @default.
• W2155577945 hasRelatedWork W2401714665 @default.
• W2155577945 hasRelatedWork W2551090916 @default.
• W2155577945 hasRelatedWork W2581944861 @default.
• W2155577945 hasRelatedWork W2594351857 @default.
• W2155577945 hasRelatedWork W2921000597 @default.
• W2155577945 hasRelatedWork W2971434450 @default.
• W2155577945 hasRelatedWork W3122884306 @default.
• W2155577945 hasVolume "4" @default.
• W2155577945 isParatext "false" @default.
• W2155577945 isRetracted "false" @default.
• W2155577945 magId "2155577945" @default.
• W2155577945 workType "article" @default.