arrow
返回

A novel exact formulation for parallel machine scheduling problems

delete2024-05-01
delete1
delete
OA
AI
L
Luana Mesquita Carrilho
F
Fabrício Oliveira *
S
Sílvio Hamacher
DOI:10.1016/j.compchemeng.2024.108649delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Machine scheduling is one of the most studied problems due to its technical challenges and prevalence in real life. In the literature, continuousand discrete-time formulations are the two most known formulations for scheduling problems. However, continuous-time formulations often suffer from weak linear relaxations, while discrete-time formulations struggle with large numbers of variables. In contrast, the bucket-indexed formulation is an alternative that mitigates both issues by working with partial time discretization. We propose a mixed-integer linear programming model based on a bucket-indexed formulation to solve a nonpreemptive scheduling problem of identical parallel machines considering release dates, deadlines, precedence, eligibility, and machine availability constraints. We evaluate the proposed formulation against real-world instances comprising more than 400 jobs and 100 machines, comparing its performance against equivalent continuousand discrete-time formulations. Remarkably, our formulation can be solved to optimality for all instances, outperforming both continuousand discrete-time formulations.
Keyword:
Scheduling
Bucket-indexed formulation
MILP formulation
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Chemical Engineering
IF:
3.9
论文数:
8.1K
被引数:
1.7W

机构

A
Aalto University
学者数:
1.6W
论文数: 1.5W
被引数: 2.1W
引用论文

引用论文

err分享
err收藏
err分享
err收藏
Role of Intermittent Fasting in the Management of Prediabetes and Type 2 Diabetes Mellitus间歇性禁食在糖尿病前期和2型糖尿病管理中的作用
err2022-09-05
err0
errOAAI
errTioluwani K Ojo; Olajide O Joshua; Oboseh J Ogedegbe; Oluwapelumi Oluwole; Ayoade Ademidun; Damilola Jesuyajolu
err分享
err收藏
学者 查看更多内容