Positive half-products and scheduling with controllable processing times

Article Abstract:

Scheduling problem of single machine with controllable job processing time to reduce both job processing and completion time is studied. This problem is demonstrated to be polynomial equivalent to positive half-product (a pseudo-Boolean function) minimization process.

Germany, Science & research, Poland, Research, Chaos theory

---

Scheduling with controllable release dates and processing times: Total completion time minimization

Article Abstract:

An algorithm to reduce the total completion time of jobs which is applicable to single machines, parallel machines and due-date scheduling problems with controllable processing times and release dates is proposed.

Interpretation and construction, Usage, Algorithms, Algorithm

---

Scheduling with controllable release dates and processing times: Makespan minimization

Article Abstract:

The scheduling problem of single machines with controllable processing times and release dates is analyzed.

Similar abstracts:

• Abstracts: An approach for integrated scheduling and lot-sizing. Scheduling with controllable release dates and processing times: total completion time minimization
• Abstracts: Batch delivery scheduling with batch delivery cost on a single machine
• Abstracts: Fuzzy goal programming approach to multilevel programming problems. Inventory model of deteriorated items with a constraint: a geometric programming approach
• Abstracts: Loading and scheduling of a flexible assembly system by mixed integer programming
• Abstracts: Key factors in increasing speed to market and improving new product success rates. Involving suppliers in product development: insights from R&D directors and project managers

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.