Paz Perez-Gonzalez
Orcid: 0000-0002-5607-2869
According to our database1,
Paz Perez-Gonzalez
authored at least 28 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Eur. J. Oper. Res., January, 2024
Assessing the level of centralisation in scheduling decisions: The role of hybrid approaches.
J. Ind. Inf. Integr., 2024
Matching inventory and demand in a Fast Moving Consumer Goods company: A Decision Support System.
Comput. Ind. Eng., 2024
2023
Ann. Oper. Res., March, 2023
2022
Constructive and composite heuristics for the 2-stage assembly scheduling problem with periodic maintenance and makespan objective.
Expert Syst. Appl., 2022
2021
New hard benchmark for the 2-stage multi-machine assembly scheduling problem: Design and computational evaluation.
Comput. Ind. Eng., 2021
2020
Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling.
Comput. Oper. Res., 2020
New efficient constructive heuristics for the two-stage multi-machine assembly scheduling problem.
Comput. Ind. Eng., 2020
Comput. Ind. Eng., 2020
2019
Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures.
Eur. J. Oper. Res., 2019
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective.
Comput. Oper. Res., 2019
Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times.
Comput. Ind. Eng., 2019
Using real-time information to reschedule jobs in a flowshop with variable processing times.
Comput. Ind. Eng., 2019
Proceedings of the Operations Research Proceedings 2019, 2019
2018
J. Intell. Manuf., 2018
Eur. J. Oper. Res., 2018
Comput. Ind. Eng., 2018
Comput. Ind. Eng., 2018
2017
The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic.
Comput. Oper. Res., 2017
New approximate algorithms for the customer order scheduling problem with total completion time objective.
Comput. Oper. Res., 2017
The value of real-time data in stochastic flowshop scheduling: A simulation study for makespan.
Proceedings of the 2017 Winter Simulation Conference, 2017
Proceedings of the 2017 Winter Simulation Conference, 2017
2016
Available-To-Promise systems in the semiconductor industry: A review of contributions and a preliminary experiment.
Proceedings of the Winter Simulation Conference, 2016
2015
Eur. J. Oper. Res., 2015
2014
A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems.
Eur. J. Oper. Res., 2014
2010
Setting a common due date in a constrained flowshop: A variable neighbourhood search approach.
Comput. Oper. Res., 2010
2009
Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics.
Comput. Oper. Res., 2009
2005
Proceedings of the Collaborative Networks and Their Breeding Environments, 2005