scientific article; zbMATH DE number 890241

MaRDI QIDQ4882527zbMATH OpenFDO

Authors Bernd Jurisch

Publication date 17 June 1996

zbMATH Keywords

branch-and-boundflexible manufacturing systemsheuristc methodsmulti-purpose machinesshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Lower bounds for the job-shop scheduling problem on multi-purpose machines
• Scheduling with arranged multi-purpose machines
• Complexity of scheduling problems with multi-purpose machines
• The complexity of two-job shop problems with multi-purpose unrelated machines.
• Tabu search for the job-shop scheduling problem with multi-purpose machines

Cited in

(21)

• Practical job shop scheduling
• A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• Tabu-search for the multi-mode job-shop problem
• Job-shop scheduling with processing alternatives.
• A batch-oblivious approach for complex job-shop scheduling problems
• Lower bounds for the job-shop scheduling problem on multi-purpose machines
• Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
• Effective neighbourhood functions for the flexible job shop problem
• Aggregation in job scheduling in machine works
• A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem
• A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
• A grasp for job shop scheduling
• Scheduling job shops with delays
• Job shop scheduling with alternative machines
• An algorithm for scheduling jobs with critical and non critical tasks in shops with no wait, multipurpose machines and deadlines
• Heuristics for generalized shop scheduling problems based on decomposition
• Scheduling in a production environment with multiple process plans per job
• Scheduling with arranged multi-purpose machines
• Adaptive multimeme algorithm for flexible job shop scheduling problem
• Discrepancy search for the flexible job shop scheduling problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882527)