Solving an integrated job-shop problem with human resource constraints
From MaRDI portal
(Redirected from Publication:744642)
Recommendations
- Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound
- Cut generation for an integrated employee timetabling and production scheduling problem
- Cut generation for an employee timetabling problem
- Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: a mathematical formulation and an anarchic society optimization algorithm
- Optimization of the integrated problem of employee timetabling and job shop scheduling
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- A hybrid method for the planning and scheduling
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Adjustment of heads and tails for the job-shop problem
- An Algorithm for Solving the Job-Shop Problem
- Cut generation for an integrated employee timetabling and production scheduling problem
- Flow Shop Scheduling with Resource Flexibility
- Logic-based Benders decomposition
- Machine scheduling with an availability constraint
- Machine scheduling with availability constraints
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- New single machine and job-shop scheduling problems with availability constraints
- New trends in machine scheduling
- Optimal parallel machines scheduling with availability constraints
- Parallel machine scheduling with machine availability and eligibility constraints
- Partitioning procedures for solving mixed-variables programming problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Scheduling with limited machine availability
- Simultaneous job scheduling and resource allocation on parallel machines
- Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound
- Staff scheduling and rostering: a review of applications, methods and models.
- The one-machine sequencing problem
Cited in
(14)- Optimization of the integrated problem of employee timetabling and job shop scheduling
- Logic-based Benders decomposition for large-scale optimization
- A classification scheme for integrated staff rostering and scheduling problems
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
- Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: a mathematical formulation and an anarchic society optimization algorithm
- A new mathematical formulation for a potash-mine shift scheduling problem with a simultaneous assignment of machines and workers
- A job-shop problem with one additional resource type
- Depth-first heuristic search for the job shop scheduling problem
- Retracted article: Multi-objective open shop scheduling by considering human error and preventive maintenance
- Cut generation for an employee timetabling problem
- Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound
- A hybrid evolutionary algorithm to solve the job shop scheduling problem
- Cut generation for an integrated employee timetabling and production scheduling problem
- A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals
This page was built for publication: Solving an integrated job-shop problem with human resource constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744642)
