job due

A new approach to job shop scheduling problems with due date constraints considering operation subcontracts [An article from: International Journal of Production Economics]
$8.95
This digital document is a journal article from International Journal of Production Economics, published by Elsevier in . The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
We consider a kind of job shop scheduling problems with due-date constraints, where temporal relaxation of machine capacity constraint is possible through subcontracts. In practice, this kind of problem is frequently found in manufacturing industries where outsourcing of manufacturing operation is possible through subcontract. We present a heuristic algorithm that addresses the problem by solving a series of smaller subproblems to optimality. For the sake of efficiency, the algorithm repeatedly executes in two steps-(1) improving the sequence of operations and (2) picking out the operations to be subcontracted-on bottleneck machines. Experiments are conducted for example problems, and the result of the experiment confirms the viability of the suggested algorithm.

Love Is in Your Face: Part 1
$1.99

Cafe Chavalos
$7.99

Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs [An article from: European Journal of Operational Research]
$7.95
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
The classical single-machine scheduling and due-date assignment problem of Panwalker et al. [Panwalker, S.S., Smith, M.L., Seidmann, A., 1982. Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research 30(2) (1982) 391-399] is the following: All n jobs share a common due-date, which is to be determined. Jobs completed prior to or after the due-date are penalized according to a cost function which is linear and job-independent. The objective is to minimize the total earliness-tardiness and due-date cost. We study a generalized version of this problem in which: (i) the earliness and tardiness costs are allowed to be job dependent and asymmetric and (ii) jobs are processed on parallel identical machines. We focus on the case of unit processing-time jobs. The problem is shown to be solved in polynomial (O(n^4)) time. Then we study the special case with no due-date cost (a classical problem known in the literature as TWET). We introduce an O(n^3) solution for this case. Finally, we study the minmax version of the problem, (i.e., the objective is to minimize the largest cost incurred by any of the jobs), which is shown to be solved in polynomial time as well.