SwePub
Sök i LIBRIS databas

  Utökad sökning

onr:"swepub:oai:DiVA.org:ltu-3472"
 

Sökning: onr:"swepub:oai:DiVA.org:ltu-3472" > Scheduling jobs on ...

  • Pei, JunSchool of Management, Hefei University of Technology, Hefei, China; Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA (författare)

Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types

  • Artikel/kapitelEngelska2016

Förlag, utgivningsår, omfång ...

  • 2015-02-15
  • Springer Science and Business Media LLC,2016
  • printrdacarrier

Nummerbeteckningar

  • LIBRIS-ID:oai:DiVA.org:ltu-3472
  • https://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-3472URI
  • https://doi.org/10.1007/s10472-015-9449-7DOI

Kompletterande språkuppgifter

  • Språk:engelska
  • Sammanfattning på:engelska

Ingår i deldatabas

Klassifikation

  • Ämneskategori:ref swepub-contenttype
  • Ämneskategori:art swepub-publicationtype

Anmärkningar

  • Validerad; 2016; Nivå 2; 20150218 (andbra)
  • 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 och genrebeteckningar

Biuppslag (personer, institutioner, konferenser, titlar ...)

  • Liu, XinbaoSchool of Management, Hefei University of Technology, Hefei, China; Key Laboratory of Process Optimization and Intelligent Decision-making of Ministry of Education, Hefei, China (författare)
  • Fan, WenjuanSchool of Management, Hefei University of Technology, Hefei, China; Department of Computer Science, North Carolina State University, Raleigh, USA (författare)
  • Pardalos, Panos M.Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA (författare)
  • Migdalas, AthanasiosLuleå tekniska universitet,Industriell Ekonomi,Division of Transportation, Construction Management and Regional Planning, Department of Civil Engineering, Aristotle University of Thessaloniki, Thessaloniki, Greece(Swepub:ltu)athmig (författare)
  • Yang, ShanlinSchool of Management, Hefei University of Technology, Hefei, China; Key Laboratory of Process Optimization and Intelligent Decision-making of Ministry of Education, Hefei, China (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, USASchool of Management, Hefei University of Technology, Hefei, China; Key Laboratory of Process Optimization and Intelligent Decision-making of Ministry of Education, Hefei, China (creator_code:org_t)

Sammanhörande titlar

  • Ingår i:Annals of Mathematics and Artificial Intelligence: Springer Science and Business Media LLC76:1-2, s. 215-2281012-24431573-7470

Internetlänk

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

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.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy