Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date

Article Abstract:

Research is presented describing the development of a batch sequencing solution incorporating both due dates and earliness/tardiness measurements within a flowshop situation.

Batch processing

---

A flexible flowshop problem with total flow time minimization

Article Abstract:

Research into a total flow time problem in the environment of a flexible flowshop proposes the use of a branch and bound algorithm to find an optimal solution.

Production control

---

On the minimization of total weighted flow time with identical and uniform parallel machines

Article Abstract:

A study was conducted to solve the NP-hard problem of scheduling tasks on similar parallel machines to reduce the total weighted flow time. A branch and bound algorithm was extended to the parallel machines to solve medium-sized problems. Results indicated that the branch and bound algorithm can be used to determine solutions to scheduling problems. Findings also showed that optimal solutions can be quickly generated for medium-sized problems.

Management Dynamics NEC, Usage, Management techniques, Heuristic programming, Branch and bound algorithms

Similar abstracts:

• Abstracts: Scheduling the production of two-component jobs on a single machine. Complexity of mixed shop scheduling problems: a survey
• Abstracts: Reformulating nonlinear combinatorial optimization problems for higher computational efficiency. On the optimization of supply chain networking decisions
• Abstracts: Improving Indochina: former iNdochina is taking advantage of a more stable economy. Berlin tegel tops up capacity
• Abstracts: Singapore appears to score in bid to challenge Hong Kong: effort to catch up as financial center includes lower business costs, tax breaks, cuts in red tape
• Abstracts: Chevron taps into China's energy output with pact to develop PetroChina gas field. International energy firms vie for PetroChina plan

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