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

Algorithms for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions

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

DOI10.1057/palgrave.jors.2601795zbMath1070.90045OpenAlexW2042051127MaRDI QIDQ4681718

No author found.

Publication date: 24 June 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601795


zbMATH Keywords

savings algorithmwafer probingparallel-machine scheduling problemsequence-dependent set-up timevehicle-routing problem with time windows


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)


Related Items

Scheduling algorithms for a semiconductor probing facility ⋮ A survey of scheduling problems with setup times or costs



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