PUC-Rio Logo Separator image Maxwell Logo Research Data Main Logo
 
Contrast
Reduce Font
Normal Font
Enlarge Font

DATASET


Title: INSTANCES FOR A COMPLEX MACHINE SCHEDULING PROBLEM
Author(s): DAVI ZERPINI MECLER
RAFAEL MARTINELLI PINTO
VICTOR ABU-MARRUL CARNEIRO DA CUNHA
Contributor(s): ---
Launched: 18/JUN/2021
Type: TEXT FILE Language(s): ENGLISH - UNITED STATES
Reference: https://www.maxwell.vrac.puc-rio.br/ResearchData/Consulta.php?strSecao=resultado&nrSeq=53328@2
DOI:
https://doi.org/10.17771/PUCRio.ResearchData.53328
Abstract:
Set with 72 instances for a complex parallel machine scheduling problem with batching considering family setup times, eligibility constraints, split jobs, machine capacity, release dates, and others. The instances have up to 10 machines and up to 100 operations to be scheduled. Operations are partitioned into families and grouped into jobs that depend on their execution to be completed. Each job has a weight (priority) that defines its importance. The problem is motivated by a real-life ship scheduling problem in the offshore oil and gas industry, with the machines representing the available fleet of vessels.
Description: File:   
COMPLETE 7Z