Matches in SemOpenAlex for { <https://semopenalex.org/work/W59918103> ?p ?o ?g. }
Showing items 1 to 79 of
79
with 100 items per page.
- W59918103 endingPage "789" @default.
- W59918103 startingPage "784" @default.
- W59918103 abstract "Abstract — The scheduling is classified as an NP-completed problem challenged for many researchers. This paper concerns with a flowshop scheduling problem with uncertain processing time. The model consists of a set of machines (multiple machines) and a set of jobs in a flowshop plant. The uncertain processing times can be represented by a discrete probability distribution. The objective is to find a job sequence such that the expected makespan is minimized. The existing lower bound extremely requires computational time. This paper proposes various lower bounds based on machines and jobs considerations. The experiments are conducted and compared with Barasubramanian and Grossman’s. The results found that on average, the branch and bound using various lower bounds used less required computational time and more branching nodes than the reference one. Index Terms — Flow shop, Uncertain processing, Probabilistic Processing Times. I. I NTRODUCTION Scheduling is important in production planning stage of manufacturing. It is aimed to help production planners and production managers to construct the time ta ble of related tas ks. A good scheduling helps manufacturer in reducing production time and cost . Flow shop problem concerns the se quencing of a given number of jobs through a series of machines in the exactly same order on all machines with the aim to satisfy a set of constraints and optimize a certain objective. The most studied objective are frequently defined as makespan meaning that the completion time of last job on last machine. A large number of deterministic scheduling algorithms have been proposed in the last five decades [1]. In reality, the environment can be uncertain in a number of factors such as processing times and cost . As a result , a num ber of papers in the recent years have addressed scheduling in the face of uncertainties under different parameters [2]. A solution to the" @default.
- W59918103 created "2016-06-24" @default.
- W59918103 creator A5051867457 @default.
- W59918103 creator A5057746129 @default.
- W59918103 creator A5059365986 @default.
- W59918103 date "2006-01-01" @default.
- W59918103 modified "2023-09-26" @default.
- W59918103 title "Improvement on Branch and Bound in Flowshop Scheduling: Probabilistic Processing Time Case." @default.
- W59918103 cites W1977108750 @default.
- W59918103 cites W1996767184 @default.
- W59918103 cites W2023170315 @default.
- W59918103 cites W2046278684 @default.
- W59918103 cites W2129998174 @default.
- W59918103 cites W2151127440 @default.
- W59918103 hasPublicationYear "2006" @default.
- W59918103 type Work @default.
- W59918103 sameAs 59918103 @default.
- W59918103 citedByCount "0" @default.
- W59918103 crossrefType "proceedings-article" @default.
- W59918103 hasAuthorship W59918103A5051867457 @default.
- W59918103 hasAuthorship W59918103A5057746129 @default.
- W59918103 hasAuthorship W59918103A5059365986 @default.
- W59918103 hasConcept C111919701 @default.
- W59918103 hasConcept C11413529 @default.
- W59918103 hasConcept C126255220 @default.
- W59918103 hasConcept C134306372 @default.
- W59918103 hasConcept C154945302 @default.
- W59918103 hasConcept C158336966 @default.
- W59918103 hasConcept C206729178 @default.
- W59918103 hasConcept C33923547 @default.
- W59918103 hasConcept C41008148 @default.
- W59918103 hasConcept C49937458 @default.
- W59918103 hasConcept C55416958 @default.
- W59918103 hasConcept C68387754 @default.
- W59918103 hasConcept C77553402 @default.
- W59918103 hasConcept C93693863 @default.
- W59918103 hasConceptScore W59918103C111919701 @default.
- W59918103 hasConceptScore W59918103C11413529 @default.
- W59918103 hasConceptScore W59918103C126255220 @default.
- W59918103 hasConceptScore W59918103C134306372 @default.
- W59918103 hasConceptScore W59918103C154945302 @default.
- W59918103 hasConceptScore W59918103C158336966 @default.
- W59918103 hasConceptScore W59918103C206729178 @default.
- W59918103 hasConceptScore W59918103C33923547 @default.
- W59918103 hasConceptScore W59918103C41008148 @default.
- W59918103 hasConceptScore W59918103C49937458 @default.
- W59918103 hasConceptScore W59918103C55416958 @default.
- W59918103 hasConceptScore W59918103C68387754 @default.
- W59918103 hasConceptScore W59918103C77553402 @default.
- W59918103 hasConceptScore W59918103C93693863 @default.
- W59918103 hasLocation W599181031 @default.
- W59918103 hasOpenAccess W59918103 @default.
- W59918103 hasPrimaryLocation W599181031 @default.
- W59918103 hasRelatedWork W1995288952 @default.
- W59918103 hasRelatedWork W2006656096 @default.
- W59918103 hasRelatedWork W2023130671 @default.
- W59918103 hasRelatedWork W2065015112 @default.
- W59918103 hasRelatedWork W2115190719 @default.
- W59918103 hasRelatedWork W2169061120 @default.
- W59918103 hasRelatedWork W2223966608 @default.
- W59918103 hasRelatedWork W2582537891 @default.
- W59918103 hasRelatedWork W2789973613 @default.
- W59918103 hasRelatedWork W2803371904 @default.
- W59918103 hasRelatedWork W2804015508 @default.
- W59918103 hasRelatedWork W2804878893 @default.
- W59918103 hasRelatedWork W2889504431 @default.
- W59918103 hasRelatedWork W2896973704 @default.
- W59918103 hasRelatedWork W2953267949 @default.
- W59918103 hasRelatedWork W2981026019 @default.
- W59918103 hasRelatedWork W3125447101 @default.
- W59918103 hasRelatedWork W3207610902 @default.
- W59918103 hasRelatedWork W42871502 @default.
- W59918103 hasRelatedWork W2183197182 @default.
- W59918103 isParatext "false" @default.
- W59918103 isRetracted "false" @default.
- W59918103 magId "59918103" @default.
- W59918103 workType "article" @default.