A constraint generation approach for two-machine shop problems with jobs selection

DOI10.1016/J.EJOR.2016.11.036zbMATH Open1402.90050OpenAlexW2555925582MaRDI QIDQ1751902FDOQ1751902

Authors F. Della Croce, C. Koulamas, Vincent T'kindt

Publication date 25 May 2018

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2016.11.036

zbMATH Keywords

schedulingconstraint generation approachjobs selectiontwo-machine shop problems

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection
• Scheduling a two-stage flowshop under makespan constraint
• Exact solution of the two-machine flow shop problem with three operations
• The job-shop problem and immediate selection
• A computational study of heuristics for two-stage flexible flowshops

Cites work

• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection
• A constraint generation algorithm for large scale linear programs using multiple-points separation
• A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment
• A survey on offline scheduling with rejection
• An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
• Computational experience with a core-based reduction procedure for the 2-knapsack problem
• Enumeration of Pareto optima for a flowshop scheduling problem with two criteria
• Minimizing tardy jobs in a flowshop with common due date
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• New results on two-machine flow-shop scheduling with rejection
• Optimal two- and three-stage production schedules with set-up time included
• Scheduling jobs on parallel machines to minimize a regular step total cost function
• Scheduling shops to minimize the weighted number of late jobs
• Two-machine flow shop scheduling problem with an outsourcing option
• Two-machine flow-shop scheduling with rejection
• Two-stage production scheduling with an outsourcing option

Cited in

(7)

• Exact solution of the two-machine flow shop problem with three operations
• Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach
• A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection
• Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm
• Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
• A survey of job shop scheduling problem: the types and models
• Scheduling a two-stage flowshop under makespan constraint

This page was built for publication: A constraint generation approach for two-machine shop problems with jobs selection

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