Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)

DOI10.1007/S10479-012-1256-5MaRDI QIDQ363579zbMATHOpenAlexFDO

Authors Gaby Pinto, Yariv T. Ben-Dov, G. Rabinowitz

Publication date 3 September 2013

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-012-1256-5

zbMATH Keywords

mixed integer linear programmingbranch and bound algorithmresource constrained scheduling problemresource-sharing and scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Production models (90B30)

Recommendations

• A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment
• Batch scheduling in process industries: An application of resource-constrained project scheduling
• A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems
• scientific article; zbMATH DE number 433057
• Complex Scheduling

Cites work

• scientific article; zbMATH DE number 3599820 (Why is no real title available?)
• scientific article; zbMATH DE number 5040453 (Why is no real title available?)
• A branch and bound algorithm for the resource-constrained project scheduling problem
• A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment
• A branch and bound method for the job-shop problem with sequence-dependent setup times
• A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags
• A new polynomial-time algorithm for linear programming
• A random key based genetic algorithm for the resource constrained project scheduling problem
• A survey of variants and extensions of the resource-constrained project scheduling problem
• A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints
• An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
• An experimental analysis of solution performance in a resource sharing and scheduling problem
• An integrated method for planning and scheduling to minimize tardiness
• Batch scheduling in a two-machine flow shop with limited buffer
• Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
• Coordination of Robots Sharing Assembly Tasks
• Evolution and state-of-the-art in integer programming
• Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)
• Loading and scheduling of a flexible assembly system by mixed integer programming.
• Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line
• Note: On Semi-Active Timetabling in Resource-Constrained Project Scheduling
• Planning and Scheduling in Manufacturing and Services
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• Project scheduling with multiple modes: A comparison of exact algorithms
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Scheduling
• Scheduling a batch processing machine with non-identical job sizes
• Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
• Scheduling with batching: A review
• Sequencing and scheduling in robotic cells: recent developments

Cited in

(2)

• Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)
• Formulation and solution of the drum-buffer-rope constraint scheduling problem ( DBRCSP)

This page was built for publication: Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)

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