A constraint generation approach for two-machine shop problems with jobs selection
From MaRDI portal
Publication:1751902
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
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
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)
Cites Work
- Optimal two- and three-stage production schedules with set-up time included
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- A survey on offline scheduling with rejection
- Title not available (Why is that?)
- Two-machine flow-shop scheduling with rejection
- New results on two-machine flow-shop scheduling with rejection
- Two-machine flow shop scheduling problem with an outsourcing option
- Two-stage production scheduling with an outsourcing option
- Scheduling jobs on parallel machines to minimize a regular step total cost function
- A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment
- Scheduling shops to minimize the weighted number of late jobs
- Enumeration of Pareto optima for a flowshop scheduling problem with two criteria
- Minimizing tardy jobs in a flowshop with common due date
- Computational experience with a core-based reduction procedure for the 2-knapsack problem
- A constraint generation algorithm for large scale linear programs using multiple-points separation
- An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
- A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection
Cited In (7)
- 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
- A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection
- Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach
- Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm
- Exact solution of the two-machine flow shop problem with three operations
- 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)
