返回
A novel exact formulation for parallel machine scheduling problems
DOI:10.1016/j.compchemeng.2024.108649.png)
摘要
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总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
引用论文
Predicting Volume and Biomass Change from Multi-Temporal Lidar Sampling and Remeasured Field Inventory Data in Panther Creek Watershed, Oregon, USA
Forests
IF0
Efficient formulation for transportation scheduling of single refinery multiproduct pipelines单炼油厂多产品管道运输调度的有效制定
Modeling offshore wind installation costs on the US Outer Continental Shelf模拟美国外大陆架上的海上风电安装成本
RENEWABLE ENERGY
IF9.1
Mineral bone disorder in children with chronic kidney disease: Data from the KNOW-Ped CKD (Korean cohort study for outcome in patients with pediatric chronic kidney disease) study慢性肾脏病患儿的矿物质骨代谢紊乱:来自KNOW-Ped CKD(韩国儿科慢性肾脏病患者预后队列研究)研究的数据

