Showing 1 - 10 of 21
This paper focuses on single machine scheduling subject to inventory constraints. Jobs either add items to an inventory or remove items from that inventory. Jobs that have to remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a...
Persistent link: https://www.econbiz.de/10008865209
Brucker et al. (Math Methods Oper Res 56: 407–412, 2003) have given an O(n 2 )-time algorithm for the problems $$P \mid p_{j}=1, r_{j}$$ , outtree $$\mid \sum C_{j}$$ and $$P \mid pmtn, p_{j}=1, r_{j}$$ , outtree $$\mid \sum C_{j}$$ . In this note, we show that their algorithm admits an O(n...
Persistent link: https://www.econbiz.de/10010759597
Brucker et al. (Math Methods Oper Res 56: 407–412, 2003) have given an O(n <Superscript>2</Superscript>)-time algorithm for the problems <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$P \mid p_{j}=1, r_{j}$$</EquationSource> </InlineEquation>, outtree <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$\mid \sum C_{j}$$</EquationSource> </InlineEquation> and <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$P \mid pmtn, p_{j}=1, r_{j}$$</EquationSource> </InlineEquation>, outtree <InlineEquation ID="IEq4"> <EquationSource Format="TEX">$$\mid \sum C_{j}$$</EquationSource> </InlineEquation>. In this note, we show that their algorithm admits an...</equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></superscript>
Persistent link: https://www.econbiz.de/10011000009
We consider several two-agent scheduling problems with controllable job processing times, where agents A and B have to share either a single machine or two identical machines in parallel while processing their jobs. The processing times of the jobs of agent A are compressible at additional cost....
Persistent link: https://www.econbiz.de/10008494806
Persistent link: https://www.econbiz.de/10005337865
Persistent link: https://www.econbiz.de/10005253460
Persistent link: https://www.econbiz.de/10005253658
Persistent link: https://www.econbiz.de/10005283663
We consider the problem of scheduling n tasks on two identical parallel processors. Task i has a processing time of one time unit, but might have to undergo processing for a second time unit with probability p<sub>i</sub>, i.e., the processing time distributions of the tasks have mass only on one and on...
Persistent link: https://www.econbiz.de/10009197474
We consider stochastic models for flow shops, job shops and open shops in which the work required by job j is the same at each machine, being a random variable W<sub>j</sub>. Because machines operate at different speeds, S<sub>i</sub>, the processing time of job j at machine i is W<sub>j</sub>/S<sub>i</sub>,. It is the main result of this...
Persistent link: https://www.econbiz.de/10009198035