It is known that the single machine scheduling problem of minimizing the number of tardy jobs is polynomially solvable. However, it becomes NP-hard if each job has a deadline. Recently, Huo et al. solved some special cases by a backwards scheduling approach. In this note we present a dual...

In this paper, the problem of minimizing maximum cost and makespan simultaneously on an unbounded parallel-batching machine is considered. An unbounded parallel-batching machine is a machine that can handle any number of jobs in a batch and the processing time of a batch is the largest...

In this paper, we consider the parallel machine scheduling with a simultaneity constraint and unit-length jobs. The problem can be described as follows. There are given m parallel machines and a graph G, whose vertices represent jobs. Simultaneity constraint means that we can process a vertex...