Showing 1 - 10 of 4,003
This paper considers one-machine sequencing situations in which agents are in a ed initial order before the processing of the machine starts. The agents are allowed to rearrange positions to save costs w.r.t. the costs given by the initial order. We will assume that the agents are not certain...
Persistent link: https://www.econbiz.de/10011087048
We consider a single-machine common due-window assignment scheduling problem, in which the processing time of a job is … provide a polynomial time algorithm to find the optimal job sequence and resource allocation, respectively. …
Persistent link: https://www.econbiz.de/10010940522
A scheduling problem with a common due-window, earliness and tardiness costs, and identical processing time jobs is …
Persistent link: https://www.econbiz.de/10010664723
Persistent link: https://www.econbiz.de/10011087197
Persistent link: https://www.econbiz.de/10011087232
The network choice revenue management problem models customers as choosing from an offerset, and the firm decides the best subset to offer at any given moment to maximize expected revenue. The resulting dynamic program for the firm is intractable and approximated by a deterministic linear...
Persistent link: https://www.econbiz.de/10008800187
Lot-sizing and capacity planning are important supply chain decisions, and competition and cooperation affect the performance of these decisions. In this paper, we look into the dynamic lot sizing and resource competition problem of an industry consisting of multiple firms. A capacity...
Persistent link: https://www.econbiz.de/10008485508
In this paper we investigate two-machine flow shop scheduling problems with deteriorating jobs and chain precedence …
Persistent link: https://www.econbiz.de/10010572535
This paper considers minimizing total completion time in a two-stage flowshop scheduling problem with m identical … time at Stage 2 is NP – hard and gave a two-approximation algorithm in O(n3) time. In the case that all jobs have arbitrary … processing time at Stage 1 and at Stage 2, we give an approximation algorithm after pointing out that in this case the problem is …
Persistent link: https://www.econbiz.de/10008738742
In this paper we study the problem of minimizing weighted earliness and tardiness on a single machine when all the jobs share the same due date. We propose two quadratic integer programming models for solving both cases of unrestricted and restricted due dates, an auxiliary model based on...
Persistent link: https://www.econbiz.de/10010995416