This paper considers a two-stage flexible flowshop scheduling problem with no waiting time between two sequential operations of a job and no idle time between two consecutive processed jobs on machines of the second stage. We show its complexity and present a heuristic algorithm with asymptotically tight error bounds. © 2004 Elsevier B.V. All rights reserved.

In shop scheduling, several applications exist where it is required that some components perform consecutively. We refer to no-idle schedules if machines are required to operate with no inserted idle time and no-wait schedules if tasks cannot wait between the end of an operation and the start of the following one. We consider here no-idle/no-wait shop scheduling problems with makespan as perfor...

Web based systems have been shown to be useful tools for supporting educational communication for teachers and students. In this paper we present such a system, which is an Integrated Distributed Learning Environment (IDLE). We present the technical description of this IDLE and we discuss its main characteristics like the transmission of multimedia data over the network, the manipulation of the...