On-line scheduling with non-crossing constraints

We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristics for the online-list and online-time problems with unit processing times, and a 3-competitive heuristic for the general online-time problem. Key words: scheduling; on-line; crane; non-crossing constraint

• Type: Journal
• Year: 2008
• Where: ORL
• Authors: Lele Zhang, Kwanniti Khammuang, Andrew Wirth
• Keywords: Latest Completion Time, Non-crossing Constraint, Online-time Problem, ORL 2006, ORL 2008