A study on the instance space of the shift minimization personnel task scheduling problem

The Digital Institutional Repository of IIM Bangalore

Please use this identifier to cite or link to this item: https://repository.iimb.ac.in/handle/2074/22055

DC Field	Value	Language
dc.contributor.author	Chandrasekharan, Reshma Chirayil
dc.contributor.author	Nurmi, Cimmo
dc.contributor.author	Kyngas, Nico
dc.date.accessioned	2023-07-06T12:24:31Z	-
dc.date.available	2023-07-06T12:24:31Z	-
dc.date.issued	2023
dc.identifier.other	WP_IIMB_682
dc.identifier.uri	https://repository.iimb.ac.in/handle/2074/22055	-
dc.description.abstract	Much like any other problem in optimization, the shift minimization task scheduling problem has also greatly benefited from the presence of a benchmark instance set. This paper studies the properties of this benchmark dataset and identifies the factors that most influence the hardness of these instances based on the performance of the state of the art solution techniques available for the problem.
dc.publisher	Indian Institute of Management Bangalore
dc.relation.ispartofseries	IIMB Working Paper-682
dc.subject	SMPTSP
dc.subject	Workforce schedules
dc.subject	Personnel task scheduling
dc.title	A study on the instance space of the shift minimization personnel task scheduling problem
dc.type	Working Paper
dc.pages	17p.
Appears in Collections:	2023 WP

File	Size	Format
WP_IIMB_682.pdf	1.32 MB	Adobe PDF	View/Open

Check