Abstracts - faqs.org

Abstracts

Engineering and manufacturing industries

Search abstracts:
Abstracts » Engineering and manufacturing industries

Scheduling families of jobs with setup times

Article Abstract:

A study presents a scheduling heuristic for groups of jobs in a common facility with similar characteristics and setup times. Scheduling problems of jobs on single and parallel machines with or without group technology assumptions are evaluated. Results reveal alternative scheduling schemes on single and parallel machines with and without GTA are either open, efficiently solvable and NP-hard relative to minimisation or maximisation of completion time and cost.

Author: Liaee, Mohammad Mehdi, Emmons, Hamilton
Publisher: Elsevier Science Publishers
Publication Name: International Journal of Production Economics
Subject: Engineering and manufacturing industries
ISSN: 0925-5273
Year: 1997
Research, Production planning, Group technology

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Parallel machine scheduling with release dates, due dates and family setup times

Article Abstract:

Production planners face the challenge of finding a balance between the efficient use of machines and delivery performance. A branch-and-bound algorithm is developed to solve a production problem where n independent jobs must be scheduled in m parallel machines and performed within set release dates, due dates and family setup times. The algorithm shows that an optimal schedule is contained in a subset of all feasible schedules.

Author: Schutten, J.M.J., Leussink, R.A.M.
Publisher: Elsevier Science Publishers
Publication Name: International Journal of Production Economics
Subject: Engineering and manufacturing industries
ISSN: 0925-5273
Year: 1996
Management, Machine shops

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Scheduling with two job classes and setup times to minimize the number of tardy jobs

Article Abstract:

A scheduling model is formulated involving the use of two heuristic algorithms and assuming the existence of two job types and a setup that is linked to its type. The model seeks to come up with a system that would minimize tardy jobs. Simulation results show that the algorithms used are more robust than those proposed by Moore and more capable of achieving desired ends.

Author: Gupta, Jatinder N.D., Ho, Johnny C.
Publisher: Elsevier Science Publishers
Publication Name: International Journal of Production Economics
Subject: Engineering and manufacturing industries
ISSN: 0925-5273
Year: 1996
Usage, Algorithms

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Models, Scheduling (Management), Production control
Similar abstracts:
  • Abstracts: Proportional lotsizing and scheduling. Due-date assignment and single machine scheduling with compressible processing times
  • Abstracts: Single machine scheduling using dominance relation to minimize earliness subject to ready and due times. Optimal pricing and product-planning for new multiattribute products based on conjoint analysis
  • Abstracts: Cashing in on the all-night session. Watching the waste line: will society really be recovering and composting its waste by 2000?
  • Abstracts: Waiting in the shadows. Planning systems review requires some finer tuning
  • Abstracts: Cashing in on the all-night session. UK lagging behind Europe on strategic development
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.