Parallel machine match-up scheduling with manufacturing cost considerations
From MaRDI portal
Publication:969751
DOI10.1007/S10951-009-0111-2zbMATH Open1185.90064OpenAlexW2157512473MaRDI QIDQ969751FDOQ969751
Authors: M. Selim Aktürk, Sinan Gürel, Alper Atamtürk 
Publication date: 7 May 2010
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-009-0111-2
Recommendations
- An anticipative scheduling approach with controllable processing times
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- Rescheduling problems with allowing for the unexpected new jobs arrival
- Match-up scheduling under a machine breakdown
- Rescheduling of identical parallel machines under machine eligibility constraints.
second-order cone programmingcontrollable processing timesmatch up timesparallel machine rescheduling
Cites Work
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- A survey of scheduling with controllable processing times
- Second-order cone programming
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Rescheduling manufacturing systems: A framework of strategies, policies, and methods
- The Nonlinear Resource Allocation Problem
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- Match-up scheduling under a machine breakdown
- Scheduling for stability in single-machine production systems
- A robust approach for the single machine scheduling problem
- Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
Cited In (13)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- An anticipative scheduling approach with controllable processing times
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness
- Technical note: A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model
- Aircraft rescheduling with cruise speed control
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- An analysis of the non-preemptive mixed-criticality match-up scheduling problem
- Parallel machine scheduling problems considering regular measures of performance and machine cost
- The job shop scheduling problem with convex costs
- On the convex hull of convex quadratic optimization problems with indicators
This page was built for publication: Parallel machine match-up scheduling with manufacturing cost considerations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q969751)
