The constrained permutation Flowshop problem: An effective two-stage iterated greedy algorithm to minimize weighted tardiness

已完结 10 由 1 发布于 2026/7/16 20:56:04

DOI:10.1016/j.swevo.2024.101696
作者：Qiu-Ying Li , Quan-Ke Pan , Liang Gao , Hong-Yan Sang , Xian-Xia Zhang , Wei-Min Li
文献类型：期刊论文
补充材料：只需要正文

Elsevier

Abstract：In the domain of just-in-time permutation flowshop scheduling, most studies typically assume that all jobs either have their own soft due date or none of them do. However, in practice, sched

应助信息

6小时前

一羊万洗

e7778afc811811f1898d34735aa3bc31.pdf 已采纳

6小时前

Book学术机器人

2026/7/16 20:56:04 未找到该文献，机器人已退出，请等待人工下载

2026/7/16 20:56:04 Book学术AI机器人收到请求，开始寻找文献

2026/7/16 20:56:04 已向机器人发送请求

6小时前

1 发布求助

上一个求助:其它数据库Naturally Fractured Carbonate Reservoir Characterization: A Case Study of a Mature High-Pour Point Oil Field in Hungary 下一个求助:SpringerStructural design and mechanical responses of closely spaced super-span double tunnels in strongly weathered tuff strata