Flow shop and open shop scheduling with a critical machine and two operations per job

Article Abstract:

Research is presented concerning the development of polynomial time algorithms suitable for use in machine open shop and flow shop makespan problems. Both problems involve the use presence of a critical machine.

Management, Industrial sites

---

A note on scheduling flowshops with flexible stage ordering

Article Abstract:

An optimal heuristic for the m-stage flowshop problem is considered, with flexible stage ordering.

---

Single machine scheduling with release times, deadlines and tardiness objectives

Article Abstract:

Research describing the minimization of tardiness for a single machine is presented. In particular a polynomial time algorithm is developed to investigate the constraints of deadlines and release times.

Similar abstracts:

• Abstracts: The multi-mode resource-constrained project scheduling problem with generalized precedence relations. An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Abstracts: Foreign edition: a newspaper war in Poland tests Europe's barriers. U.S. publishers use 'outserts' to cater to advertisers
• Abstracts: Single machine group scheduling with resource dependent setup and processing times. Minimizing maximum lateness under linear deterioration
• Abstracts: A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets. New stopping criterion for genetic algorithms
• Abstracts: Second order symmetric duality in multiobjective programming involving generalized cone-invex functions. Multiobjective second order symmetric duality with cone constraints

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.