The two-machine total completion time flow shop problem

Article Abstract:

The NP-hard scheduling problem of minimizing total completion time in a two-machine flow shop is examined. Five known lower bounds and two new ones are shown. Various versions of a branch and bound method are developed by using, both individually and combined, these lower bounds. A heuristic process which employs a constructive O(n squared) time method, which calculates a good starting solution and a neighborhood search based on pairwise interchanges, is shown.

Models, Heuristic programming, Branch and bound algorithms

---

A greedy-based neighborhood search approach to a nurse rostering problem

Article Abstract:

A practical nurse rostering problem of an Italian hospital is considered. The nurse rostering is required to generate the nursing staff shifts subject to various operational and contractual requirements.

Italy, HEALTH SERVICES, Offices of All Other Miscellaneous Health Practitioners, Offices of health practitioners, not elsewhere classified, Nurses, Human resource management, Health care industry, Company personnel management

---

Scheduling trainees at a hospital department using a branch-and-price approach

Article Abstract:

A study uses integer programming to examine scheduling of the work of trainees in a hospital.

Belgium, Analysis, Training, Integer programming

Similar abstracts:

• Abstracts: Minimizing total completion time and total deviation of job completion times from a restrictive due-date. Scheduling with general job-dependent learning curves
• Abstracts: The combined cutting stock and lot-sizing problem in industrial processes. Stock selection heuristics for interdependent items
• Abstracts: The application of information and communication technologies in transport
• Abstracts: BP moves to clean up troubles: guilty plea on 2005 blast, trading-charges settlement expected to come tomorrow
• Abstracts: The stealth of days are over... it's about time we evolved. A wave of reality should bring a more realistic perspective

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