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

Practical job shop scheduling

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

DOI10.1023/A:1018955929512zbMath0911.90221OpenAlexW2124131658MaRDI QIDQ1273124

J. M. J. Schutten

Publication date: 6 December 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018955929512

zbMATH Keywords

job shop schedulingshifting bottleneck procedure


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)


Related Items

A multi-criteria approach for scheduling semiconductor wafer fabrication facilities, A branch and bound method for the job-shop problem with sequence-dependent setup times, Modeling realistic hybrid flexible flowshop scheduling problems, Surgical case scheduling as a generalized job shop scheduling problem, Alternative graph formulation for solving complex factory-scheduling problems, Scheduling job shop problems with sequence-dependent setup times, A scatter search approach to sequence-dependent setup times job shop scheduling, Computing lower and upper bounds for a large-scale industrial job shop scheduling problem, Concurrent operations can be parallelized in scheduling multiprocessor job shop, Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis



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