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

Complexity of workforce scheduling in transfer lines

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

DOI10.1023/A:1024818502622zbMath1033.90045OpenAlexW1557632039MaRDI QIDQ1407252

George L. Vairaktarakis, Xiaoqiang Cai

Publication date: 15 September 2003

Published in: Journal of Global Optimization (Search for Journal in Brave)

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


zbMATH Keywords

complexityschedulingproduction system


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Complexity and performance of numerical algorithms (65Y20)


Related Items (2)

Optimal workforce assignment to operations of a paced assembly line ⋮ Cyclic job scheduling in paced assembly lines with cross-trained workers






This page was built for publication: Complexity of workforce scheduling in transfer lines

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