Approximability of single machine scheduling with fixed jobs to minimize total completion time
Article Abstract:
The analysis of the approximability of the schedules of fixed jobs on a single machine in a flowshop, subject to precedence constraints, is presented.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2007
Management dynamics, Machine Job Shops, Machine Shops, Industrial machinery, not elsewhere classified, Management, Company business management, Stochastic approximation
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2007
User Contributions:
Comment about this article or add new information about this topic:
Single machine scheduling with resource dependent release times and processing times
Article Abstract:
A heuristic approach, which examines the single machine scheduling problem with resource dependent release times and processing times, is presented.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
Hong Kong, Heuristic, Production planning, Heuristics (Psychology)
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
Subjects list: Methods, China, Usage, Scheduling (Management)
Similar abstracts:
- Abstracts: Batch delivery scheduling with batch delivery cost on a single machine
- Abstracts: Single machine scheduling with batch deliveries. Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
- Abstracts: Below the line is the bottom line. I the Chapman report
- Abstracts: Theory of portfolios: new considerations on classic models and the Capital Market Line. Auctions with bidder-determined allowable combinations
- Abstracts: A survey for the quadratic assignment problem. A quadratic programming approach to the multi-product newsvendor problem with side constraints
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.