Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries.
- Published in:
- Annals of Operations Research, 2011, v. 191, n. 1, p. 171, doi. 10.1007/s10479-011-1000-6
- By:
- Publication type:
- Article
Works matching IS 02545330 AND DT 2011 AND VI 191 AND IP 1
Results: 15
1
2
Improved complexity results for several multifacility location problems on trees.
- Published in:
- Annals of Operations Research, 2011, v. 191, n. 1, p. 23, doi. 10.1007/s10479-011-0905-4
- By:
- Publication type:
- Article
3
Ensuring the boundedness of the core of games with restricted cooperation.
- Published in:
- Annals of Operations Research, 2011, v. 191, n. 1, p. 137, doi. 10.1007/s10479-011-0920-5
- By:
- Publication type:
- Article
4
Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects.
- Published in:
- Annals of Operations Research, 2011, v. 191, n. 1, p. 155, doi. 10.1007/s10479-011-0923-2
- By:
- Publication type:
- Article
5
Value of supplier's capacity information in a two-echelon supply chain.
- Published in:
- Annals of Operations Research, 2011, v. 191, n. 1, p. 115, doi. 10.1007/s10479-011-0937-9
- By:
- Publication type:
- Article
6
An optimization model and a solution algorithm for the many-to-many car pooling problem.
- Published in:
- Annals of Operations Research, 2011, v. 191, n. 1, p. 37, doi. 10.1007/s10479-011-0948-6
- By:
- Publication type:
- Article
7
Controlling job arrivals with processing time windows into Batch Processor Buffer.
- Published in:
- Annals of Operations Research, 2011, v. 191, n. 1, p. 193, doi. 10.1007/s10479-011-0952-x
- By:
- Publication type:
- Article
8
Existence conditions for generalized vector variational inequalities.
- Published in:
- Annals of Operations Research, 2011, v. 191, n. 1, p. 255, doi. 10.1007/s10479-011-0955-7
- By:
- Publication type:
- Article
9
A note on the proof of the complexity of the little-preemptive open-shop problem.
- Published in:
- Annals of Operations Research, 2011, v. 191, n. 1, p. 251, doi. 10.1007/s10479-011-0975-3
- By:
- Publication type:
- Article
10
A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty.
- Published in:
- Annals of Operations Research, 2011, v. 191, n. 1, p. 219, doi. 10.1007/s10479-011-0996-y
- By:
- Publication type:
- Article
11
An efficient memetic algorithm for the graph partitioning problem.
- Published in:
- Annals of Operations Research, 2011, v. 191, n. 1, p. 1, doi. 10.1007/s10479-011-0983-3
- By:
- Publication type:
- Article
12
Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines.
- Published in:
- Annals of Operations Research, 2011, v. 191, n. 1, p. 97, doi. 10.1007/s10479-011-0985-1
- By:
- Publication type:
- Article
13
Inventory models with ramp type demand rate, time dependent deterioration rate, unit production cost and shortages.
- Published in:
- Annals of Operations Research, 2011, v. 191, n. 1, p. 73, doi. 10.1007/s10479-011-0984-2
- By:
- Publication type:
- Article
14
To lay out or not to lay out?
- Published in:
- Annals of Operations Research, 2011, v. 191, n. 1, p. 183, doi. 10.1007/s10479-011-1005-1
- By:
- Publication type:
- Article
15
List of Referees.
- Published in:
- Annals of Operations Research, 2011, v. 191, n. 1, p. 263, doi. 10.1007/s10479-011-0998-9
- Publication type:
- Article