this paper deals with the single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. we have adopted the common cycle scheduling policy and assumed that the setup times for production of each product can be non-zero. further, we have assumed that defective items will be reworked and the inspection costs during the normal prod...

nowadays, scheduling problems have a considerable application in production and service systems. in this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. in many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combinat...

in this paper a new problem of three stage disassembly-assembly scheduling is introduced and reviewed. this problem, which was arisen from the aviation industry characteristics, is a generalization of the two stage assembly scheduling problem. products (helicopters) in the aviation industry return to assembler for annual overhaul repair services. in the first stage helicopters are disassembled ...

In any system that multiplexes resources, the problem of scheduling what computations run where and when is perhaps most fundamental. Yet, like many other essential problems in computing (e.g., query optimization databases), academic research moves a pendulum, with periods intense activity followed by dormancy it considered "solved" problem. These three papers make significant contributions to ...