id:"swepub:oai:DiVA.org:ltu-3472"
Sökning: id:"swepub:oai:DiVA.org:ltu-3472" > Scheduling jobs on ...
- 1 av 1
- Föregående post
- Nästa post
- Till träfflistan
Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types
-
- Pei, Jun (författare)
- School of Management, Hefei University of Technology, Hefei, China; Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA
-
- Liu, Xinbao (författare)
- School of Management, Hefei University of Technology, Hefei, China; Key Laboratory of Process Optimization and Intelligent Decision-making of Ministry of Education, Hefei, China
-
- Fan, Wenjuan (författare)
- School of Management, Hefei University of Technology, Hefei, China; Department of Computer Science, North Carolina State University, Raleigh, USA
- visa fler...
- visa färre...
- (creator_code:org_t)
- 2015-02-15
- 2016
- Engelska.
- Ingår i: Annals of Mathematics and Artificial Intelligence. - : Springer Science and Business Media LLC. - 1012-2443 .- 1573-7470. ; 76:1-2, s. 215-228
- Tidskriftsartikel (refereegranskat)
Abstract
Ämnesord
Stäng
- This paper investigates a scheduling model with certain co-existing features of serial-batching, dynamic job arrival, multi-types of job, and setup time. In this proposed model, the jobs of all types are first partitioned into serial batches, which are then processed on a single serial-batching machine with an independent constant setup time for each new batch. In order to solve this scheduling problem, we divide it into two phases based on job arrival times, and we also derive and prove certain constructive properties for these two phases. Relying on these properties, we develop a two-phase hybrid algorithm (TPHA). In addition, a valid lower bound of the problem is also derived. This is used to validate the quality of the proposed algorithm. Computational experiments, both with small- and large-scale problems, are performed in order to evaluate the performance of TPHA. The computational results indicate that TPHA outperforms seven other heuristic algorithms. For all test problems of different job sizes, the average gap percentage between the makespan, obtained using TPHA, and the lower bound does not exceed 5.41 %.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Maskinteknik -- Produktionsteknik, arbetsvetenskap och ergonomi (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Mechanical Engineering -- Production Engineering, Human Work Science and Ergonomics (hsv//eng)
Nyckelord
- Serial-batching scheduling
- Dynamic job arrival
- Multiple job types
- Single machine
- Setup time
- Industrial Logistics
- Industriell logistik
- Intelligent industrial processes (AERI)
- Intelligenta industriella processer (FOI)
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
- Annals of Mathematics and Artificial Intelligence (Sök värdpublikationen i LIBRIS)
Till lärosätets databas
- 1 av 1
- Föregående post
- Nästa post
- Till träfflistan
Hitta mer i SwePub
- Av författaren/redakt...
- Pei, Jun
- Liu, Xinbao
- Fan, Wenjuan
- Pardalos, Panos ...
- Migdalas, Athana ...
- Yang, Shanlin
- Om ämnet
-
- TEKNIK OCH TEKNOLOGIER
- TEKNIK OCH TEKNO ...
- och Maskinteknik
- och Produktionstekni ...
- Artiklar i publikationen
- Annals of Mathem ...
- Av lärosätet
- Luleå tekniska universitet
Sök utanför SwePub
- Sök vidare i:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - Nationella bibliotekssystem
- LIBRIS.kb.se
