✦ LIBER ✦

Robust ship scheduling with multiple time windows

✍ Scribed by Marielle Christiansen; Kjetil Fagerholt

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 109 KB
Volume: 49
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.10033

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The quay crane scheduling problem with t

The quay crane scheduling problem with time windows

✍ Frank Meisel 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 500 KB

The quay crane scheduling problem consists of scheduling tasks for loading and unloading containers on cranes that are assigned to a vessel for its service. This article introduces a new approach for quay crane scheduling, where the availability of cranes at a vessel is restricted to certain time wi

Single-vehicle scheduling with time wind

Single-vehicle scheduling with time window constraints

✍ Gilbert H. Young; Chi-Lok Chan 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 164 KB

In the single-vehicle scheduling problem with time window constraints, a vehicle has to visit a set of sites on a graph, and each site must be visited after its ready time but no later than its deadline. The goal is to minimize the total time taken to visit all sites. We prove the conjecture propose

Robust analysis of nonlinear discrete sy

Robust analysis of nonlinear discrete systems with multiple time delays

✍ Lung-Sheng Sun; Ke-Hsiang Chen 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 459 KB 👁 2 views

In this paper, we present the stability criteria, sufficient conditions that guarantee the robust stability of linear structured or unstructured variation of discrete time-delay systems subjected to the given bounds of nonlinear function. Both single and composite nonlinear discrete systems with mul

A branch-and-price algorithm for paralle

A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities

✍ Jonathan F. Bard; Siwate Rojanasoonthon 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 1 views

## Abstract This paper presents a branch‐and‐price algorithm for scheduling __n__ jobs on __m__ nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of __ρ__ priority classes and may require two operations. The objective i

Online real-time preemptive scheduling o

Online real-time preemptive scheduling of jobs with deadlines on multiple machines

✍ Bhaskar Das Gupta; Michael A. Palis 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 139 KB

In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized in terms of their minimum stretch factor (or, equivalently, their maximum execution rate r = 1= ). We consider two well-

Robust reliable control for discrete-tim

Robust reliable control for discrete-time-delay systems with stochastic nonlinearities and multiplicative noises

✍ Yisha Liu; Zidong Wang; Wei Wang 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract This paper is concerned with the reliable control problem against actuator failures for a class of uncertain discrete‐time stochastic nonlinear time‐delay systems. The failures of actuators are quantified by a variable varying in a given interval. The stochastic nonlinearities described