This paper addresses a batch delivery single-machine scheduling problem in which jobs have an assignable common due window. Each job will incur an early (tardy) penalty if it is early (tardy) with respect to the common due window under a given schedule. There is no capacity limit on each...

This paper considers a variation of the classical single machine scheduling problem with tool changes. In the variation, two sets of jobs, namely special jobs and normal jobs, are considered. By special jobs, we mean that each special job must be processed within the first prefixed time units of...

In this paper, we investigate a single-machine problem with the learning effect and release times where the objective is to minimize the makespan. A branch-and-bound algorithm incorporating with several dominance properties and lower bounds is developed to derive the optimal solution. A...

This paper presents a critical review of research in end-user information system satisfaction (EUISS). An extensive literature search is conducted from which over 50 EUISS related papers are identified. It is found that the past research is dominated by the expectation disconfirmation approach....

This paper sets out to explore the quality initiatives of various industries and examine the links between quality management implementation and quality outcomes. We use the scenario in Hong Kong as a first step in addressing these research inquiries. Using Black and Porter's instrument...