Heuristics for scheduling in a Kanban system with dual blocking mechanisms

Article Abstract:

A study on the scheduling in a Kanban system with double blocking capabilities is presented. The two classes of blocking that concurrently operates in dual blocking mechanisms are the blocking due to queue size, and the blocking due to part-type. Recursive equations are formulated for timetabling of containers in static Kanban system. Two heuristics were used to meet the objectives of limiting the total weighted waitingtime of containers and total weighted flowtime of part-types.

Production Management, Usage, Just in time inventory systems, Just in time systems, Heuristic programming

---

A multi-objective simulated annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs

Article Abstract:

The problems of developing non-dominated scheduling of permutation flowshops with the objectives of minimizing the makespan and total flowtime of jobs are analyzed. A multi-objective simulated-annealing algorithm (MOSA) is developed to address this problem. The relevant details of this algorithm are presented.

Methods, Analysis, Simulated annealing (Mathematics)

---

Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date

Article Abstract:

Two problems of m-machine flow shop scheduling are considered in order to minimize the variations in job completion times and to minimize the mean of squares of deviations of job completion times around a common due date.

Machine shops

Similar abstracts:

• Abstracts: Services branding: revealing the rhetoric within retail banking . Marketing performance and business risk in acutecare health trusts - a new comparative approach
• Abstracts: Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging. Bicriteria sequencing methods for the mixed-model assembly line in just-in-time production systems
• Abstracts: New inequalities for the General Routing Problem. The minimum size instance of a pallet loading problem equivalence class
• Abstracts: A method for dealing with inconsistencies in pairwise comparisons. Characterization of certain orders using their choice functions

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