A bicriteria approach to the two-machine flow shop scheduling problem

Article Abstract:

A study was conducted to analyze the problem of simultaneously reducing makespan and sum of completion times of a two-machine flow shops. The problem was characterized as a bicriteria scheduling concern. A branch-and-bound process was determined to iteratively promote solutions to restricted single objective scheduling concerns. In addition, a way of carrying out the sum of completion times lower bound to solve the sum of completion times minimization problem was presented.

Machine Job Shops, Machine Shops, Management Dynamics NEC, Industrial machinery, not elsewhere classified, Management techniques

---

Assembly line balancing in a mixed-model sequencing environment with synchronous transfers

Article Abstract:

The assembly line balancing problem in a mixed -model line, which is operated under, a cyclic sequencing approach are described. The assembly line balancing problem with the objective of minimizing total cycle time by incorporating the cyclic sequence information are formulated.

Strategy & planning, Planning, Company business planning, Assembly-line methods, Assembly lines, Assembly-line balancing

---

Discrete optimization: the two-machine flowship total completion time problem: improved lower bounds and a branch-and-bound algorithm

Article Abstract:

The efficacy of branch-and-bound algorithm to find answers for two-machine flowship problem vis-a-vis reducing the time taken to finish jobs 60 (45) jobs has been studied. The procedures used in the study have been discussed.

Europe, Production management, Inventory Control, Manufacturing industry, Manufacturing industries, Usage, Machinery, Time management, Magneto-electric machines

Similar abstracts:

• Abstracts: Vehicle routing with a sparse feasibility graph. Minimizing the makespan for the flow shop scheduling problem with availability constraints
• Abstracts: Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems. Lower bounds for resource-constrained project scheduling problems

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