Melola Discovery

← Melola Discovery

Jurnal SINTA 2

Real-Life Optimum Shift Scheduling Design

Journal of ICT Research and Applications (JICTRA) · Vol. 13 No. 1 (2019) · pp. 19–35

DOI
10.5614/itbj.ict.res.appl.2019.13.1.2
ISSN
2338-5499, 2337-5787
Published
2019-04-30
Publisher
DRI - ITB
Language
eng

Abstract

In many industries, manpower shift scheduling poses problems that require immediate solutions. The fundamental need in this domain is to ensure that all shifts are assigned to cover all or as many jobs as possible. The shifts should additionally be planned with minimum manpower utilization, minimum manpower idleness and enhanced adaptability of employee schedules. The approach used in this study was to utilize an existing manpower prediction method to decide the minimum manpower required to complete all jobs. Based on the minimum manpower number and shift criteria, the shifts were assigned to form schedules using random pick and criteria-based selection methods. The potential schedules were then optimized and the best ones selected. Based on several realistic test instances, the proposed heuristic approach appears to offer promising solutions for shift scheduling as it improves shift idle time, complies with better shift starting time and significantly reduces the manpower needed and the time spent on creating schedules, regardless of data size.

Keywords

Collaboration network of the authors

2 authors · 1 co-authorship link

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Universiti Malaysia Sarawak
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://journals.itb.ac.id/index.php/jictra/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Real-Life Optimum Shift Scheduling Design</dc:title>
	<dc:creator>Kong Weng, Lee</dc:creator>
	<dc:creator>Nah, Sze San</dc:creator>
	<dc:subject xml:lang="en-US">criteria-based</dc:subject>
	<dc:subject xml:lang="en-US">heuristic algorithm</dc:subject>
	<dc:subject xml:lang="en-US">minimum manpower</dc:subject>
	<dc:subject xml:lang="en-US">random pick</dc:subject>
	<dc:subject xml:lang="en-US">shift design</dc:subject>
	<dc:subject xml:lang="en-US">shift scheduling</dc:subject>
	<dc:subject xml:lang="en-US">shift starting time</dc:subject>
	<dc:subject xml:lang="en-US">two-stage scheduling</dc:subject>
	<dc:description xml:lang="en-US">In many industries, manpower shift scheduling poses problems that require immediate solutions. The fundamental need in this domain is to ensure that all shifts are assigned to cover all or as many jobs as possible. The shifts should additionally be planned with minimum manpower utilization, minimum manpower idleness and enhanced adaptability of employee schedules. The approach used in this study was to utilize an existing manpower prediction method to decide the minimum manpower required to complete all jobs. Based on the minimum manpower number and shift criteria, the shifts were assigned to form schedules using random pick and criteria-based selection methods. The potential schedules were then optimized and the best ones selected. Based on several realistic test instances, the proposed heuristic approach appears to offer promising solutions for shift scheduling as it improves shift idle time, complies with better shift starting time and significantly reduces the manpower needed and the time spent on creating schedules, regardless of data size.</dc:description>
	<dc:publisher xml:lang="en-US">DRI - ITB</dc:publisher>
	<dc:date>2019-04-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journals.itb.ac.id/index.php/jictra/article/view/9108</dc:identifier>
	<dc:identifier>10.5614/itbj.ict.res.appl.2019.13.1.2</dc:identifier>
	<dc:source xml:lang="en-US">Journal of ICT Research and Applications; Vol. 13 No. 1 (2019); 19-35</dc:source>
	<dc:source>2338-5499</dc:source>
	<dc:source>2337-5787</dc:source>
	<dc:source>10.5614/itbj.ict.res.appl.2019.13.1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journals.itb.ac.id/index.php/jictra/article/view/9108/4173</dc:relation>
</oai_dc:dc>