Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Modified bottleneck-based heuristic for large-scale job-shop scheduling problems with a single bottleneck

From MaRDI portal
Publication:2895304
Jump to:navigation, search

DOI10.1016/S1004-4132(07)60129-7zbMath1243.90073OpenAlexW1513888968MaRDI QIDQ2895304

Zuo Yan, Xi Yugeng, Gu Hanyu

Publication date: 2 July 2012

Published in: Journal of Systems Engineering and Electronics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1004-4132(07)60129-7


zbMATH Keywords

bottleneckjob shop scheduling problemshifting bottleneck procedure


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)


Related Items

Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm ⋮ A variable neighborhood MOEA/D for multiobjective test task scheduling problem ⋮ Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2895304&oldid=15850927"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki