Learn More
We consider the problem of common due window location scheduling on a single machine, where the processing times of jobs depend both on their starting times and positions in a sequence. The problem is to determine the optimal earliest due date, the due window size, and the job schedule simultaneously to minimize costs for earliness, tardiness, earliest due(More)
In the papers by Kellerer et al. (1995) and Zhang (1997) the authors investigate a semi on-line version of a classical parallel machine scheduling problem. In the semi on-line version, there is a buffer of length k which is available to maintain k jobs. The jobs arrive one by one and can be temporarily assigned to the buffer if the buffer is not full. The(More)
We found that protein trafficking between apical and basal cell can be unidirectional, which reveals the different roles of the two cells in the cell-to-cell communication between them during early embryogenesis. In most angiosperm species, asymmetric zygote division results in an apical cell and a basal cell that have distinct cell fates. Much has been(More)