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

The wafer probing scheduling problem (WPSP)

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

DOI10.1057/palgrave.jors.2601362zbMath1099.90543OpenAlexW1977571694MaRDI QIDQ4656694

No author found.

Publication date: 14 March 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.2601362


zbMATH Keywords

parallel machine schedulingvehicle routing with time windowswafer probing


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)


Related Items

Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals ⋮ Scheduling algorithms for a semiconductor probing facility ⋮ A new paradigm for rule-based scheduling in the wafer probe centre ⋮ A survey of scheduling problems with setup times or costs ⋮ An adaptive memory programming method for risk logistics operations ⋮ Scheduling of wafer test processes in semiconductor manufacturing



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4656694&oldid=18863560"
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 18:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki